Fast algorithm for optimal error protection of embedded wavelet codes

Stankovic, V. and Hamzaoui, R. and Saupe, D. (2001) Fast algorithm for optimal error protection of embedded wavelet codes. In: 4th IEEE Workshop on Multimedia Signal Processing (MMSP 01), 2001-10-03 - 2001-10-05.

Full text not available in this repository.Request a copy from the Strathclyde author

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.