Abstract
Lossless text compression methods involve some form of moderately high-order exact string matching. However, this work cannot easily be carried over to lossless image compression, because images are two-dimensional and (more important) essentially quantized analog data. A better plan is to find and encode as much of the image structure of the data as possible, and then to encode efficiently the unstructured, noisy residual. In three steps the authors predict the value of each pixel, model the error of the prediction, and encode the error of the prediction. Having a probabilistic model for the errors, they can use arithmetic coding to encode the errors efficiently with respect to the model. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have