DocumentCode
2466878
Title
Information theoretic bounds for data hiding in compressed images
Author
Ramkumar, Mahalingam ; Akansu, Ali N.
Author_Institution
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fYear
1998
fDate
7-9 Dec 1998
Firstpage
267
Lastpage
272
Abstract
We present an information-theoretic approach to obtain an estimate of the number of bits that can be hidden in still images, or, the capacity of the data-hiding channel. We show how addition of the message signal in a suitable transform domain rather than the spatial domain can significantly increase the channel capacity. We compare the capacities achievable with different decompositions like DCT, DFT, Hadamard, and subband transforms
Keywords
Hadamard transforms; channel capacity; copyright; data compression; data encapsulation; discrete Fourier transforms; discrete cosine transforms; image coding; transform coding; DCT; DFT; Hadamard transform; compressed images; copyright protection; data hiding; data-hiding channel capacity; information theoretic bounds; message signal; spatial domain; still images; subband transform; transform domain; Access control; Additive noise; Copyright protection; Data encapsulation; Discrete cosine transforms; Gaussian noise; Image coding; PSNR; Steganography; Watermarking;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Signal Processing, 1998 IEEE Second Workshop on
Conference_Location
Redondo Beach, CA
Print_ISBN
0-7803-4919-9
Type
conf
DOI
10.1109/MMSP.1998.738945
Filename
738945
Link To Document