Image coding requires an effective representation of images to provide dimensionality reduction, a quantization strategy to maintain quality, and finally the error free encoding of quantized coefficients. In the coding of quantized coefficients, Huffman coding and arithmetic coding have been used most commonly and are suggested as alternatives in the JPEG standard. In some recent work, zerotree coding has been proposed as an alternate method, that considers the dependece of quantized coefficients from subband to subband, and thus appears as a generalization of the context-based approach often used with arithmetic coding. In this paper, we propose to review these approaches and discuss them as special cases of an analysis based approach to the coding of coefficients. The requirements on causality and computational complexity implied by arithmetic and zerotree coding will be studied and other schemes proposed for the choice of the predictive coefficient contexts that are suggested by image analysis.
[1]
V. Ralph Algazi,et al.
Comparison of wavelet image coders using picture quality scale (PQS)
,
1995,
Defense, Security, and Sensing.
[2]
Benjamin Belzer,et al.
Filter evaluation and selection in wavelet image compression
,
1994,
Proceedings of IEEE Data Compression Conference (DCC'94).
[3]
Glen G. Langdon,et al.
Universal modeling and coding
,
1981,
IEEE Trans. Inf. Theory.
[4]
Ian H. Witten,et al.
Arithmetic coding for data compression
,
1987,
CACM.
[5]
V. Ralph Algazi,et al.
Comparative study of wavelet image coders
,
1996
.
[6]
Jerome M. Shapiro,et al.
Embedded image coding using zerotrees of wavelet coefficients
,
1993,
IEEE Trans. Signal Process..