Joint decoding of unequally protected JPEG2000 bitstreams and reed-Solomon codes

Authors:
Sohail Bahmani;Ivan V. Bajic;Atousa HajShirmohammadi
Affiliations:
Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA and School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada;School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada;School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada
Venue:
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Year:
2010

Citing 8
Cited 0

Video Processing and Communications

Video Processing and Communications
JPEG 2000: Image Compression Fundamentals, Standards and Practice

JPEG 2000: Image Compression Fundamentals, Standards and Practice
Advances in the scalable amendment of H.264/AVC

IEEE Communications Magazine
Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction

IEEE Journal on Selected Areas in Communications
LDPC-Based Iterative Joint Source-Channel Decoding for JPEG2000

IEEE Transactions on Image Processing
Iterative Decoding of Serially Concatenated Arithmetic and Channel Codes With JPEG 2000 Applications

IEEE Transactions on Image Processing
Real-time error protection of embedded codes for packet erasure and fading channels

IEEE Transactions on Circuits and Systems for Video Technology
Error Resilient Decoding of JPEG2000

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present joint decoding of JPEG2000 bitstreams and Reed-Solomon codes in the context of unequal loss protection. Using error resilience features of JPEG2000 bitstreams, the joint decoder helps to restore the erased symbols when the Reed-Solomon decoder fails to retrieve them on its own. However, the joint decoding process might become time-consuming due to a search through the set of possible erased symbols. We propose the use of smaller codeblocks and transmission of a relatively small amount of side information with high reliability as two approaches to accelerate the joint decoding process. The accelerated joint decoder can deliver essentially the same quality enhancement as the nonaccelerated one, while operating several times faster.