Fast algorithm for optimal error protection of embedded wavelet codes

V. Stankovic, R. Hamzaoui, D. Saupe

Research output: Contribution to conferencePaper

11 Citations (Scopus)

Abstract

Embedded wavelet codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. Sherwood and Zeger protected a zero-tree based embedded wavelet code sent through a memoryless noisy channel by using cyclic redundancy detection codes (CRC) and channel correction codes. Chande and Farvardin proposed an optimal joint source-channel allocation strategy for such systems. We show how to accelerate their algorithm without quality loss. For grey scale test images of size 512 x 512, our speedup factors ranged from 1.2 to 6 for total bit rates between 0.25 and 1.0 bits per pixel. Moreover, by using turbo codes as channel codes, we obtained competitive peak-signal-to-noise ratio (PSNR) results.
Original languageEnglish
Pages593-598
Number of pages5
Publication statusPublished - Oct 2001
Event4th IEEE Workshop on Multimedia Signal Processing (MMSP 01) - Cannes, France
Duration: 3 Oct 20015 Oct 2001

Conference

Conference4th IEEE Workshop on Multimedia Signal Processing (MMSP 01)
CountryFrance
CityCannes
Period3/10/015/10/01

Keywords

  • computer science
  • theory & methods
  • fast algorithms
  • software engineering
  • error protection
  • embedded wavelet codes

Fingerprint Dive into the research topics of 'Fast algorithm for optimal error protection of embedded wavelet codes'. Together they form a unique fingerprint.

  • Cite this

    Stankovic, V., Hamzaoui, R., & Saupe, D. (2001). Fast algorithm for optimal error protection of embedded wavelet codes. 593-598. Paper presented at 4th IEEE Workshop on Multimedia Signal Processing (MMSP 01) , Cannes, France.