In this paper, we propose an image compression method using the wavelet transform and context-based arithmetic coding exploiting bit plane conelation. The proposed method decomposes an image into several subband images using the discrete wavelet transform; the transform coefficients in each subband are classified into two classes; each subband image is then quantized; a "shuffling" process is applied to quantized wavelet coefficients; and finally arithmetic coding using the optimum context is carried out for bit plane coding of each subband. The performance improvement of the proposed method turns out to be mainly due to the "shuffling" process and the optimum context for arithmetic coding. Experimental results show that the proposed coder is similar to or superior to well-known existing coders, e.g. EZW and SPIHT, for images with low conelation.
[1]
Ian H. Witten,et al.
Arithmetic coding for data compression
,
1987,
CACM.
[2]
Michael W. Marcellin,et al.
Comparison of different methods of classification in subband coding of images
,
1997,
IEEE Trans. Image Process..
[3]
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..
[4]
Avideh Zakhor,et al.
Multirate 3-D subband coding of video
,
1994,
IEEE Trans. Image Process..
[5]
C.-C. Jay Kuo,et al.
Improvements of embedded zerotree wavelet (EZW) coding
,
1995,
Other Conferences.