Image coding by folding

We propose an image coding algorithm which employs data hiding techniques to "fold" an image into itself. Data hiding is a process of encoding extra information into a host image by making small modifications to its pixels. In our approach, an image is split into two parts of equal size: a host image and a residual image. The residual image is compressed into a bit stream and then embedded into the host image. The host image, which is 50% of the size of the original image, is coded using standard compression techniques. The embedded data does not increase the bit rate of the coded image. As a result, one may code only 50% pixels of the original image and still have perfect reconstruction. Experimental results indicate that the algorithm has a lot of potential in image coding.

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

[2]  Michel Barlaud,et al.  Image coding using vector quantization in the wavelet transform domain , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[3]  Bin Zhu,et al.  Robust data hiding for images , 1996, 1996 IEEE Digital Signal Processing Workshop Proceedings.

[4]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[5]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .