Lossless Coding Using Predictors and Arithmetic Code Optimized for Each Image

This paper proposes an efficient lossless coding scheme for still images. The scheme utilizes a block-adaptive prediction technique to effectively remove redundancy in a given image. The resulting prediction errors are encoded using a kind of context-adaptive arithmetic coding method. In order to improve coding efficiency, a generalized Gaussian function is used as a probability distribution model of the prediction errors in each context. Moreover, not only the predictors but also parameters of the probability distribution models are iteratively optimized for each image so that a coding rate of the prediction errors can have a minimum. Experimental results show that an average coding rate of the proposed coding scheme is close to 90% of that of JPEG-LS and is lower than that of TMW.

[1]  Ichiro Matsuda,et al.  Lossless coding of still images using minimum-rate predictors , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[2]  Kuldip K. Paliwal,et al.  Classified adaptive prediction and entropy coding for lossless coding of images , 1997, Proceedings of International Conference on Image Processing.

[3]  Michael Schindler,et al.  A fast renormalisation for arithmetic coding , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[4]  Bernd Meyer,et al.  TMW - a new method for lossless image compression , 1997 .

[5]  Nasir D. Memon,et al.  Context-based, adaptive, lossless image coding , 1997, IEEE Trans. Commun..

[6]  Ichiro Matsuda,et al.  Design of a minimum-rate predictor and its application to lossless image coding , 2000, 2000 10th European Signal Processing Conference.

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