Concealing a secret image using the breadth first traversal linear quadtree structure

This paper presents an image hiding method which embeds the secret image in the least significant bits (LSB) of the pixels selected from a cover image. Generally, LSB-related methods are rather sensitive to the modifications on the cover image. To abate the damage to the reconstructed cover image, this proposed method hence embeds the vital data of the cover image in more significant bits. This paper also provides a breadth first traversal (BFT) linear quadtree representation to characterize a compressed binary image. The data in the front of this structure are vital data; yet, those in the rear are the trivial ones. The strategy of this representation does facilitate image embedding.

[1]  Tsong Wuu Lin,et al.  Set operations on constant bit-length linear quadtrees , 1997, Pattern Recognit..

[2]  Ross Anderson,et al.  Information hiding terminology , 1996 .

[3]  Birgit Pfitzmann,et al.  Digital Signature Schemes , 1996, Lecture Notes in Computer Science.

[4]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[5]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[6]  Chin-Chen Chang,et al.  A new scheme for sharing secret color images in computer network , 2000, Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568).

[7]  Yeuan-Kuen Lee,et al.  High capacity image steganographic model , 2000 .

[8]  Chin-Chen Chang,et al.  An Improved VQ Codebook Search Algorithm Using Principal Component Analysis , 1997, J. Vis. Commun. Image Represent..

[9]  Chin-Chen Chang,et al.  An Efficient Data Structure for Storing Similar Binary Images , 2001, FODO.

[10]  Chin-Chen Chang,et al.  A virtual image cryptosystem based upon vector quantization , 1998, IEEE Trans. Image Process..