Algorithmic modifications to SPIHT

This paper proposes several low complexity algorithmic modifications to the SPIHT (set partitioning in hierarchical trees) image coding method of Said and Pearlman (1996). The modifications exploit universal traits common to the real world images. Approximately 1-2% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

[1]  William A. Pearlman,et al.  An image multiresolution representation for lossless and lossy compression , 1996, IEEE Trans. Image Process..

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

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

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

[5]  Detlev Marpe,et al.  A two-layered wavelet-based algorithm for efficient lossless and lossy image compression , 2000, IEEE Trans. Circuits Syst. Video Technol..

[6]  Thomas R. Fischer,et al.  Quadtree classification and TCQ image coding , 2001, IEEE Trans. Circuits Syst. Video Technol..

[7]  David S. Taubman,et al.  High performance scalable image compression with EBCOT , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).