Paper
22 January 1999 Theoretical capacity measures for data hiding in compressed images
Mahalingam Ramkumar, Ali Naci Akansu
Author Affiliations +
Proceedings Volume 3528, Multimedia Systems and Applications; (1999) https://doi.org/10.1117/12.337438
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States
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 the addition of the message signal or signature in a suitable transform domain rather than the spatial domain can significantly increase the channel capacity. Most of the state-of-the-art schemes developed thus far for data-hiding have embedded bits in some transform domain, as it has always been implicitly understood that a decomposition would help. In this paper we compare the achievable data-hiding capacities for different decompositions like DCT, Hartley, Hadamard, and subband transforms. We show that transforms with inferior energy compaction property like Hartley and Hadamard are better choices for the decomposition, than transforms with good energy-compaction property, like DCT or subband transforms.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mahalingam Ramkumar and Ali Naci Akansu "Theoretical capacity measures for data hiding in compressed images", Proc. SPIE 3528, Multimedia Systems and Applications, (22 January 1999); https://doi.org/10.1117/12.337438
Lens.org Logo
CITATIONS
Cited by 21 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Image processing

Visualization

Data hiding

Chromium

Image quality

Visual process modeling

RELATED CONTENT

Data hiding technique in JPEG compressed domain
Proceedings of SPIE (August 01 2001)
Slant transform watermarking for digital images
Proceedings of SPIE (June 23 2003)
Analysis of a wavelet-based robust hash algorithm
Proceedings of SPIE (June 22 2004)
Data hiding in halftone images with parity coding
Proceedings of SPIE (August 01 2001)

Back to Top