A robust information hiding methodology in wavelet domain

With the proliferation of digital multimedia, information hiding techniques have become more attractive to the researchers. High bitrate information hiding is different from digital watermarking: the former one tries to hide relatively large amount of auxiliary information instead of just one or a few verification bits. This paper presents a novel Discrete Wavelet Transform (DWT) domain high bitrate information hiding algorithm. In the proposed algorithm, the coefficients within the approximation subband of the one-level wavelet decomposition are grouped into vectors to embed information bits. Low-frequency coefficients have been chosen for information hiding due to their relatively large amplitudes and the corresponding smaller step size in JPEG2000 quantization. A mathematical model is proposed to predict the Bit-Error-Rate (BER) of the algorithm under JPEG2000 compression. The proposed algorithm has reached an initial channel capacity of 1/64 bits per pixel (bpp). With performance improvements, the channel capacity has been increased to 1/32bpp and 1/16bpp, at the price of slightly higher BER. Preliminary experiments indicate that the algorithm is robust and most of the hidden information survives JPEG2000 compression.

[1]  Mauro Barni,et al.  Capacity of the watermark channel: how many bits can be hidden within a digital image? , 1999, Electronic Imaging.

[2]  Sanjit K. Mitra,et al.  A source and channel coding approach to data hiding with application to hiding speech in video , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[3]  N. Bourbakis,et al.  Data-image-video encryption , 2004, IEEE Potentials.

[4]  Deepa Kundur,et al.  The choice of watermark domain in the presence of compression , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[5]  N. Bourbakis,et al.  A high bitrate information hiding algorithm for digital video content under H.264/AVC compression , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[6]  Josef Scharinger.  Fast encryption of image data using chaotic Kolmogorov flows , 1998, J. Electronic Imaging.

[7]  Lintian Qiao,et al.  A New Algorithm for MPEG Video Encryption , 2007 .

[8]  Lei Tang,et al.  Methods for encrypting and decrypting MPEG video data efficiently , 1997, MULTIMEDIA '96.

[9]  Iskender Agi,et al.  An empirical study of secure MPEG video transmissions , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.

[10]  Shih-Fu Chang,et al.  Watermarking capacity of digital images based on domain-specific masking effects , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[11]  Deepa Kundur.  Implications for high capacity data hiding in the presence of lossy compression , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[12]  N. Bourbakis,et al.  SCAN-Based Compression-Encryption-Hiding for Video on Demand , 2003, IEEE Multim..

[13]  B. S. Manjunath,et al.  Data hiding in video , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[14]  Henry Ker-Chang Chang,et al.  A linear quadtree compression scheme for image encryption , 1997, Signal Process. Image Commun..

[15]  Ahmed H. Tewfik,et al.  Data hiding for video-in-video , 1997, Proceedings of International Conference on Image Processing.

[16]  Russell M. Mersereau,et al.  A novel approach for increasing security and data embedding capacity in images for data hiding applications , 2001, Proceedings International Conference on Information Technology: Coding and Computing.