The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
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-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-LS.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Run-length encodings (Corresp.)
Golomb, S. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053907 · Cited by 988
Context-based, adaptive, lossless image coding
Wu, X., & Memon, N. D. (1997) · IEEE Transactions on Communications · doi:10.1109/26.585919 · Cited by 984
Universal coding, information, prediction, and estimation
Rissanen, J. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056936 · Cited by 898
LOCO-I: a low complexity, context-based, lossless image compression algorithm
Weinberger, M. J., Seroussi, G., & Sapiro, G. (2002) · Proceedings of Data Compression Conference - DCC '96 · doi:10.1109/dcc.1996.488319 · Cited by 529
Self-citationGeneralized Kraft Inequality and Arithmetic Coding
Rissanen, J. J. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.203.0198 · Cited by 510
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Netravali, A. N., & Limb, J. O. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11647 · Cited by 451
Cited by
Zhou, J., Liu, X., Au, O. C., & Tang, Y. Y. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2291625 · Cited by 192
A block-permutation-based encryption scheme with independent processing of RGB components
IMAIZUMI, S., & KIYA, H. (2018) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2018edt0002 · Cited by 18
Dai, Y., Xue, C., & Zhou, L. (2022) · PLOS ONE · doi:10.1371/journal.pone.0263729 · Cited by 6
On the Optimal Calculation of the Rice Coding Parameter
Solano Donado, F. (2020) · Algorithms · doi:10.3390/a13080181 · Cited by 4
Metadata
- Authors
- Weinberger, M. J., Seroussi, G., & Sapiro, G.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2000
- Volume
- 9
- Issue
- 8
- Pages
- 1309-1324
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2153638435
- Cited by
- 1,638
- References
- 19
- FWCI
- 43.40
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS. https://app.cochat.ai/papers/10.1109/83.855427
- The paper
- Weinberger, M. J., Seroussi, G., & Sapiro, G. (2000). The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS. IEEE Transactions on Image Processing. https://doi.org/10.1109/83.855427
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.