SBHP-a low complexity wavelet coder

We present a low-complexity entropy coder originally designed to work in the JPEG2000 image compression standard framework. The algorithm is meant for embedded and non-embedded coding of wavelet coefficients inside a subband, and is called subband-block hierarchical partitioning (SBHP). It was extensively tested following the standard experiment procedures, and it was shown to yield a significant reduction in the complexity of entropy coding, with small loss in compression performance. Furthermore, it is able to seamlessly support all JPEG2000 features. We present a description of the algorithm, an analysis of its complexity, and a summary of the results obtained after its integration into the verification model (VM).

[1]  William A. Pearlman,et al.  Embedded and efficient low-complexity hierarchical image coder , 1998, Electronic Imaging.

[2]  J. Andrew.  A simple and efficient hierarchical image coder , 1997, Proceedings of International Conference on Image Processing.

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

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

[5]  Jin Li,et al.  An embedded still image coder with rate-distortion optimization , 1999, IEEE Trans. Image Process..

[6]  Amir Said,et al.  Simplified segmentation for compound image compression , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).