Robust Image-Adaptive Data Hiding Based on Erasure and Error Correction

K. Solanki, N. Jacobsen, U. Madhow, B. S. Manjunath*, and S. Chandrasekaran
Dept. of Electrical and Computer Engineering
University of California at Santa Barbara
Santa Barbara, CA 93106
*Corresponding author: Ph (805) 893-7112
E-mail: manj [at]


Information-theoretic analyses for data hiding prescribe embedding the hidden data in the choice of quantizer for the host data. In this paper, we propose practical realizations of this prescription for data hiding in images, with a view to hiding large volumes of data with low perceptual degradation. The hidden data can be recovered reliably under attacks such as compression, and limited amounts of image tampering and image resizing. The three main findings are as follows: (i) In order to limit perceivable distortion while hiding large amounts of data, hiding schemes must use image-adaptive criteria in addition to statistical criteria based on information theory. (ii) The use of local criteria to choose where to hide data can potentially cause desynchronization of the encoder and decoder. This synchronization problem is solved by the use of powerful, but simple to implement, erasures and errors correcting codes, which also provide robustness against a variety of attacks. (iii) For simplicity, scalar quantization based hiding is employed, even though information-theoretic guidelines prescribe vector quantization based methods. However, an information-theoretic analysis for an idealized model is provided to show that scalar quantization based hiding incurs approximately only a 2 dB penalty in terms of resilience to attack.
[PDF] [BibTex]
K. Solanki, N. Jacobsen, U. Madhow, B. S. Manjunath and S. Chandrasekaran,
IEEE Transactions on Image Processing, vol. 13, no. 12, pp. 1627-1639, Dec. 2004.
Node ID: 384 , DB ID: 183 , VRLID: 141 , Lab: VRL , Target: Journal
Subject: [Digital Watermarking and Data Hiding] « Look up more