Split field coding: low complexity error-resilient entropy coding for image compression

James J. Meany; Christopher J. Martens

doi:10.1117/12.797357

Translator Disclaimer

15 September 2008 Split field coding: low complexity error-resilient entropy coding for image compression

James J. Meany, Christopher J. Martens

Author Affiliations +

Proceedings Volume 7073, Applications of Digital Image Processing XXXI; 707316 (2008) https://doi.org/10.1117/12.797357
Event: Optical Engineering + Applications, 2008, San Diego, California, United States

Abstract

In this paper, we describe split field coding, an approach for low complexity, error-resilient entropy coding which splits code words into two fields: a variable length prefix and a fixed length suffix. Once a prefix has been decoded correctly, then the associated fixed length suffix is error-resilient, with bit errors causing no loss of code word synchronization and only a limited amount of distortion on the decoded value. When the fixed length suffixes are segregated to a separate block, this approach becomes suitable for use with a variety of methods which provide varying protection to different portions of the bitstream, such as unequal error protection or progressive ordering schemes. Split field coding is demonstrated in the context of a wavelet-based image codec, with examples of various error resilience properties, and comparisons to the rate-distortion and computational performance of JPEG 2000.

Citation Download Citation

James J. Meany and Christopher J. Martens "Split field coding: low complexity error-resilient entropy coding for image compression", Proc. SPIE 7073, Applications of Digital Image Processing XXXI, 707316 (15 September 2008); https://doi.org/10.1117/12.797357

ACCESS THE FULL ARTICLE