An Image Compression System

A lossless image compression system is described, which consists of a statistical model and an arithmetic code. The model first performs a prediction of each pixel by a plane, and then it collects the occurrence counts of the prediction errors, conditioned on past pixels forming a "context". The counts are collected in a tree, constructed adaptively, and the size of the context with which each pixel is encoded is optimized.

[1]  Jorma Rissanen,et al.  Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.

[2]  Glen G. Langdon,et al.  Universal modeling and coding , 1981, IEEE Trans. Inf. Theory.

[3]  Jorma Rissanen,et al.  Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..

[4]  JORMA RISSANEN,et al.  A universal data compression system , 1983, IEEE Trans. Inf. Theory.