New methods for lossless image compression using arithmetic coding
Authors:
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-266
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.Keywords
This publication has 12 references indexed in Scilit:
- Analysis of arithmetic coding for data compression2002
- Reversible intraframe compression of medical imagesIEEE Transactions on Medical Imaging, 1988
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Image Compression Based On Hierarchical Encoding1986
- Data Compression Using Adaptive Coding and Partial String MatchingIEEE Transactions on Communications, 1984
- Image data compression: A reviewProceedings of the IEEE, 1981
- Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemesProceedings of the IEEE, 1980
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Comparison of nth-Order DPCM Encoder With Linear Transformations and Block Quantization TechniquesIEEE Transactions on Communication Technology, 1971
- Predictive Quantizing Systems (Differential Pulse Code Modulation) for the Transmission of Television SignalsBell System Technical Journal, 1966