We present a new embedded zerotree wavelet image coding algorithm that is based on the algorithms developed by Shapiro (see IEEE Trans. Signal Processing, Spec. Issue Wavelets Signal Processing, vol.41, no.12, p.3445-62, 1993) and Said et al. (see IEEE Trans. Circuits Syst. Video Technol., vol.6, no.6, p.243-50, 1996). Our algorithm features a relatively simple coding structure and provides a better framework for balancing between high compression performance and robustness to channel errors. The fundamental approach is to explicitly classify the encoder's output bit sequence into subsequences, which are then protected differently according to their importance and robustness. Experimental results indicate that, for noisy channels, the proposed algorithm is slightly more resilient to channel errors than more complex and sophisticated source-channel coding algorithms. More important is that our algorithm is substantially more robust with respect to varying channel error conditions. This provides much needed reliability in low-bandwidth wireless applications.
[1]
Nariman Farvardin,et al.
Subband Image Coding Using Entropy-Coded Quantization over Noisy Channels
,
1992,
IEEE J. Sel. Areas Commun..
[2]
Jerome M. Shapiro,et al.
Embedded image coding using zerotrees of wavelet coefficients
,
1993,
IEEE Trans. Signal Process..
[3]
Joachim Hagenauer,et al.
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
,
1988,
IEEE Trans. Commun..
[4]
Michael T. Orchard,et al.
Space-frequency quantization for a space-varying wavelet packet image coder
,
1995,
Proceedings., International Conference on Image Processing.
[5]
Qing Chen,et al.
Robust quantization for image coding and noisy digital transmission
,
1996,
Proceedings of Data Compression Conference - DCC '96.
[6]
William A. Pearlman,et al.
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
,
1996,
IEEE Trans. Circuits Syst. Video Technol..