On the JPEG model for lossless image compression

Author

Langdon, G. ; Gulati, Aashini ; Seiler, Ed

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

fYear

1992

fDate

24-27 March 1992

Firstpage

172

Lastpage

180

Abstract

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

Keywords

data compression; image coding; Bostelmann technique; JPEG model; Sunset; adaptive arithmetic coding; binarization tree; binary encodings; compression gain; context model; gray-scale images; lossless arithmetic coding algorithm; lossless image compression; parameter reduction; speed; test image; Aerospace engineering; Context modeling; Digital arithmetic; Encoding; Gray-scale; Image coding; NASA; Partitioning algorithms; Probability distribution; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1992. DCC '92.

Conference_Location

Snowbird, UT, USA

Print_ISBN

0-8186-2717-4

Type

conf

DOI

10.1109/DCC.1992.227464

Filename

227464