Information theoretic bounds for data hiding in compressed images
Document Type
Conference Proceeding
Publication Date
1-1-1998
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.
Identifier
85017314138 (Scopus)
ISBN
[0780349199, 9780780349193]
Publication Title
1998 IEEE 2nd Workshop on Multimedia Signal Processing
External Full Text Location
https://doi.org/10.1109/MMSP.1998.738945
First Page
267
Last Page
272
Volume
1998-December
Recommended Citation
Ramkumar, M. and Akansu, A. N., "Information theoretic bounds for data hiding in compressed images" (1998). Faculty Publications. 16425.
https://digitalcommons.njit.edu/fac_pubs/16425
