On zerotree quantization for embedded wavelet packet image coding

Wavelet packets are an effective representation tool for adaptive waveform analysis of a given signal. We first combine the wavelet packet representation with zerotree quantization for image coding. A general zerotree structure is defined which can adapt itself to any arbitrary wavelet packet basis. We then describe an efficient coding algorithm based on this structure. Finally, the hypothesis for prediction of coefficients from coarser scale to finer scale is tested and its effectiveness is compared with that of zerotree hypothesis for wavelet coefficients.

[1]  Nasir M. Rajpoot,et al.  Wavelet Packet Image Coding Using Compatible Zerotree Quantization , 1999 .

[2]  Michelle Effros.  Zerotree design for image compression: toward weighted universal zerotree coding , 1997, Proceedings of International Conference on Image Processing.

[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]  Michael T. Orchard,et al.  Wavelet packet image coding using space-frequency quantization , 1998, IEEE Trans. Image Process..

[5]  Thomas S. Huang,et al.  Image processing , 1971 .

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

[7]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[8]  Ronald R. Coifman,et al.  Fast wavelet packet image compression , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[9]  K Ramchandran,et al.  Best wavelet packet bases in a rate-distortion sense , 1993, IEEE Trans. Image Process..