Lossy-to-Lossless Compression of Images Based on Binary Tree Decomposition

A new lossy-to-lossless quality-progressive method for image coding is presented. This method is based on binary tree decomposition and context-based arithmetic coding. Experimental results obtained with the eighteen 8-bit ISO images show that the proposed method attains an average lossless compression gain of 7.9% with respect to JPEG2000. Compared to JPEG-LS, the compression gain is 3.1%, but this compression standard does not allow lossy-to-lossless decoding.

[1]  Guillermo Sapiro,et al.  The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS , 2000, IEEE Trans. Image Process..

[2]  Xin Chen,et al.  A new compression scheme for color-quantized images , 2002, IEEE Transactions on Circuits and Systems for Video Technology.

[3]  Armando J. Pinho,et al.  A context adaptation model for the compression of images with a reduced number of colors , 2005, IEEE International Conference on Image Processing 2005.

[4]  Michael W. Marcellin,et al.  JPEG2000 - image compression fundamentals, standards and practice , 2002, The Kluwer International Series in Engineering and Computer Science.