Translator Disclaimer
1 May 1994 Fast progressive lossless image compression
Author Affiliations +
Proceedings Volume 2186, Image and Video Compression; (1994)
Event: IS&T/SPIE 1994 International Symposium on Electronic Imaging: Science and Technology, 1994, San Jose, CA, United States
We present a method for progressive lossless compression of still grayscale images that combines the speed of our earlier FELICS method with the progressivity of our earlier MLP method. We use MLP's pyramid-based pixel sequence, and image and error modeling and coding based on that of FELICS. In addition, we introduce a new prefix code with some advantages over the previously used Golomb and Rice codes. Our new progressive method gives compression ratios and speeds similar to those of non-progressive FELICS and those of JPEG lossless mode, also a non-progressive method. The image model in Progressive FELICS is based on a simple function of four nearby pixels. We select two of the four nearest known pixels, using the two with the middle (non-extreme) values. Then we code the pixel's intensity relative to the selected pixels, using single bits, adjusted binary codes, and simple prefix codes like Golomb codes, Rice codes, or the new family of prefix codes introduced here. We estimate the coding parameter adaptively for each context, the context being the absolute value of the difference of the predicting pixels; we adjust the adaptation statistics of the beginning of each level in the progressive pixel sequence.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Paul G. Howard and Jeffrey Scott Vitter "Fast progressive lossless image compression", Proc. SPIE 2186, Image and Video Compression, (1 May 1994);


DCT-based video compression using arithmetic coding
Proceedings of SPIE (May 31 1990)
Reversible transform coding of images
Proceedings of SPIE (February 26 1996)
Survey Of Lossless Image Coding Techniques
Proceedings of SPIE (April 04 1989)

Back to Top