Simple and efficient wavelet image compression

We propose a simple but efficient wavelet image compression algorithm. The proposed coding scheme employs the multi-level dyadic wavelet decomposition, linear quantization with a proper dead zone, 1-D addressing complexity by raster scanning within subbands, variable length block coding, small alphabet representation of 1-D integer sequences, and adaptive arithmetic entropy coding. Despite the simplicity of the proposed coding scheme, the rate-distortion performance of the proposed image compression algorithm is competitive with the best image coders in the literature.

[1]  Jianhua Chen,et al.  Context modeling and entropy coding of wavelet coefficients for image compression , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  Thomas R. Fischer,et al.  Comparison of different image subband coding methods at low bit rates , 1999, IEEE Trans. Circuits Syst. Video Technol..

[3]  Truong Q. Nguyen,et al.  A progressive transmission image coder using linear phase uniform filterbanks as block transforms , 1999, IEEE Trans. Image Process..

[4]  Roberto H. Bamberger,et al.  Optimum classification in subband coding of images , 1994, Proceedings of 1st International Conference on Image Processing.

[5]  Michael T. Orchard,et al.  Space-frequency quantization for wavelet image coding , 1996, Optics & Photonics.

[6]  Min-Jen Tsai,et al.  Stack-run image coding , 1996, IEEE Trans. Circuits Syst. Video Technol..

[7]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..