Efficient arithmetic coding for wavelet image compression

We address efficient context modeling in arithmetic coding for wavelet image compression. Quantized highpass wavelet coefficients are first mapped into a binary source, followed by high order context modeling in arithmetic coding. A blending technique is used to combine results of context modeling of different orders into a single probability estimate. Experiments show that an arithmetic coder with efficient context modeling is capable of achieving a 10 percent bitrate saving over a zeroth order adaptive arithmetic coder in high performance wavelet image coders.

[1]  Itu-T Video coding for low bitrate communication , 1996 .

[2]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[3]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[4]  Glen G. Langdon,et al.  An Introduction to Arithmetic Coding , 1984, IBM J. Res. Dev..

[5]  Kou-Hu Tzou High-order entropy coding for images , 1992, IEEE Trans. Circuits Syst. Video Technol..

[6]  Glen G. Langdon,et al.  Universal modeling and coding , 1981, IEEE Trans. Inf. Theory.

[7]  Nikolas P. Galatsanos,et al.  Prioritized DCT for compression and progressive transmission of images , 1992, IEEE Trans. Image Process..

[8]  Ming-Ting Sun,et al.  Design and hardware architecture of high-order conditional entropy coding for images , 1992, IEEE Trans. Circuits Syst. Video Technol..