The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Progressive image coding for noisy channels
Abstract
We cascade an existing image coder with carefully chosen error control coding, and thus produce a progressive image compression scheme whose performance on a noisy channel is significantly better than that of previously known techniques. The main idea is to trade off the available transmission rate between source coding and channel coding in an efficient manner. This coding system is easy to implement and has acceptably low complexity. Furthermore, effectively no degradation due to channel noise can be detected; instead, the penalty paid due to channel noise is a reduction in source coding resolution. Detailed numerical comparisons are given that can serve as benchmarks for comparisons with future encoding schemes. For example, for the 512/spl times/512 Lena image, at a transmission rate of 1 b/pixel, and for binary symmetric channels with bit error probabilities 10/sup -3/, 10/sup -2/, and 10/sup -1/, the proposed system outperforms previously reported results by at least 2.6, 2.8, and 8.9 dB, respectively.
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 new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
Embedded image coding using zerotrees of wavelet coefficients
Shapiro, J. M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258085 · Cited by 4,815
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
Hagenauer, J. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2763 · Cited by 1,827
List Viterbi decoding algorithms with applications
Seshadri, N., & Sundberg, C.-E. W. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.577040 · Cited by 371
Cited by
Chang, S.-H., Cosman, P. C., & Milstein, L. B. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2081682 · Cited by 480
Mohr, A. E., Riskin, E. A., & Ladner, R. E. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.848236 · Cited by 458
Optimized transmission of JPEG2000 streams over wireless channels
Thomos, N., Boulgouris, N. V., & Strintzis, M. G. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860338 · Cited by 258
Metadata
- Authors
- Sherwood, P. G., & Zeger, K.
- Venue
- IEEE Signal Processing Letters
- Published
- 1997-07
- Volume
- 4
- Issue
- 7
- Pages
- 189-191
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2112653999
- Cited by
- 310
- References
- 5
- FWCI
- 13.11
- 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: Progressive image coding for noisy channels. https://app.cochat.ai/papers/10.1109/97.596882
- The paper
- Sherwood, P. G., & Zeger, K. (1997). Progressive image coding for noisy channels. IEEE Signal Processing Letters. https://doi.org/10.1109/97.596882
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.