The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 9 (8), 1309-1324
- https://doi.org/10.1109/83.855427
Abstract
LOCO-I (LOw COmplexity LOssless COmpression for Images) is the algorithm at the core of the new ISO/ITU standard for lossless and near-lossless compression of continuous-tone images, JPEG-LS. It is conceived as a “low complexity projection” of the universal context modeling paradigm, matching its modeling unit to a simple coding unit. By combining simplicity with the compression potential of context models, the algorithm “enjoys the best of both worlds.” It is based on a simple fixed context model, which approaches the capability of the more complex universal techniques for capturing high-order dependencies. The model is tuned for efficient performance in conjunction with an extended family of Golomb (1966) type codes, which are adaptively chosen, and an embedded alphabet extension for coding of low-entropy image regions. LOCO-I attains compression ratios similar or superior to those obtained with state-of-the-art schemes based on arithmetic coding. Moreover, it is within a few percentage points of the best available compression ratios, at a much lower complexity level. We discuss the principles underlying the design of LOCO-I, and its standardization into JPEC-LSKeywords
This publication has 35 references indexed in Scilit:
- Modeling and low-complexity adaptive coding for image prediction residualsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reversible compression of HDTV images using median adaptive prediction and arithmetic codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On adaptive strategies for an extended family of Golomb-type codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal prefix codes for sources with two-sided geometric distributionsIEEE Transactions on Information Theory, 2000
- Coding of sources with two-sided geometric distributions and unknown parametersIEEE Transactions on Information Theory, 2000
- A universal finite memory sourceIEEE Transactions on Information Theory, 1995
- Some properties of sequential predictors for binary Markov sourcesIEEE Transactions on Information Theory, 1993
- Two-dimensional linear prediction and its application to adaptive predictive coding of imagesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966