15 September 2008 Split field coding: low complexity error-resilient entropy coding for image compression
Author Affiliations +
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
James J. Meany, James J. Meany, Christopher J. Martens, 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); doi: 10.1117/12.797357; https://doi.org/10.1117/12.797357
PROCEEDINGS
16 PAGES


SHARE
RELATED CONTENT

New approach to JPEG 2000 compliant region-of-interest coding
Proceedings of SPIE (December 07 2001)
Low bit rate near-transparent image coding
Proceedings of SPIE (April 06 1995)
Image coding methods and their assessment
Proceedings of SPIE (October 01 1992)

Back to Top