Quantization performance in SPIHT and related wavelet image compression algorithms

The set partitioning in hierarchical trees (SPIHT) image coding algorithm is observed to provide progressive classification of the wavelet coefficients. The achievable quantization performance of the induced classes is evaluated for entropy coded scalar quantization and trellis coded quantization, and is compared to the first-order rate distortion function.

[1]  Thomas R. Fischer,et al.  TCQ subband image coding to exploit dependence , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[2]  Michael W. Marcellin,et al.  Universal trellis coded quantization , 1999, IEEE Trans. Image Process..

[3]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[4]  Michael W. Marcellin,et al.  Comparison of different methods of classification in subband coding of images , 1997, IEEE Trans. Image Process..

[5]  Nariman Farvardin,et al.  Optimum quantizer performance for a class of non-Gaussian memoryless sources , 1984, IEEE Trans. Inf. Theory.

[6]  Thomas R. Fischer,et al.  Image subband coding using arithmetic coded trellis coded quantization , 1995, IEEE Trans. Circuits Syst. Video Technol..

[7]  Sumit Chawla,et al.  Image coding using optimized significance tree quantization , 1997, Proceedings DCC '97. Data Compression Conference.

[8]  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..