On the JPEG model for lossless image compression

The JPEG lossless arithmetic coding algorithm and a predecessor algorithm called Sunset both employ adaptive arithmetic coding with the context model and parameter reduction approach of Todd et al. The authors compare the Sunset and JPEG context models for the lossless compression of gray-scale imag...

Full description

Saved in:
Bibliographic Details
Published inData Compression Conference, 1992 pp. 172 - 180
Main Authors Langdon, G., Gulati, A., Seiler, E.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Aerospace engineering
Context modeling
Digital arithmetic
Encoding
Gray-scale
Image coding
NASA
Partitioning algorithms
Probability distribution
Transform coding
Online AccessGet full text

Cover

More Information
Summary:The JPEG lossless arithmetic coding algorithm and a predecessor algorithm called Sunset both employ adaptive arithmetic coding with the context model and parameter reduction approach of Todd et al. The authors compare the Sunset and JPEG context models for the lossless compression of gray-scale images, and derive new algorithms based on the strengths of each. The context model and binarization tree variations are compared in terms of their speed (the number of binary encodings required per test image) and their compression gain. In this study, the Bostelmann (1974) technique is studied for use at all resolutions, whereas in the arithmetic coded JPEG lossless, the technique is applied only at the 16-bit per pixel resolution.< >
ISBN:0818627174
9780818627170
DOI:10.1109/DCC.1992.227464