A family of efficient and channel error resilient wavelet/subband image coders

We present a new wavelet/subband framework that allows the efficient and effective quantization/coding of subband coefficients in both noiseless and noisy channel environments. Two different models, one based on a zero-tree structure and another based on a quadtree and context-based modeling structure, are introduced for coding the locations of significant subband coefficients. Then, several multistage residual lattice vector quantizers are proposed for the quantization of such coefficients. The proposed framework features relatively simple modeling and quantization/coding structures that produce a bit stream containing two distinct bit sequences, which can then be protected differently according to their importance and channel noise sensitivity levels. The resulting wavelet/subband image coding algorithms provide good tradeoffs between compression performance and resilience to channel errors, In fact, experimental results indicate that for both noiseless and noisy channels, the resulting coders outperform most of the source-channel coders reported in the literature. More importantly, our coders are substantially more robust than all previously reported source-channel coders with respect to varying channel error conditions. This is a desired feature in low-bandwidth wireless applications.

[1]  Wilson C. Chung,et al.  A jointly optimized subband coder , 1996, IEEE Trans. Image Process..

[2]  Nariman Farvardin,et al.  Subband Image Coding Using Entropy-Coded Quantization over Noisy Channels , 1992, IEEE J. Sel. Areas Commun..

[3]  Michael T. Orchard,et al.  Morphological representation of wavelet data for image coding , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[4]  P. G. Sherwood,et al.  Progressive image coding on noisy channels , 1997, Proceedings DCC '97. Data Compression Conference.

[5]  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..

[6]  F. Kossentini,et al.  Robust EZW image coding for noisy channels , 1997, IEEE Signal Processing Letters.

[7]  N. J. A. Sloane,et al.  Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.

[8]  C. Chrysafis,et al.  Efficient context-based entropy coding for lossy wavelet image compression , 1997, Proceedings DCC '97. Data Compression Conference.

[9]  Michael T. Orchard,et al.  Space-frequency quantization for wavelet image coding , 1996, Optics & Photonics.

[10]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[11]  Michel Barlaud,et al.  Image coding using wavelet transform , 1992, IEEE Trans. Image Process..

[12]  Faouzi Kossentini,et al.  A class of EZW image coders for noisy channels , 1997, Proceedings of International Conference on Image Processing.

[13]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[14]  Michael W. Marcellin,et al.  Comparison of different methods of classification in subband coding of images , 1997, IEEE Trans. Image Process..

[15]  Michel Barlaud,et al.  Pyramidal lattice vector quantization for multiscale image coding , 1994, IEEE Trans. Image Process..

[16]  Faouzi Kossentini,et al.  Necessary conditions for the optimality of variable-rate residual vector quantizers , 1995, IEEE Trans. Inf. Theory.

[17]  Qing Chen,et al.  Robust quantization for image coding and noisy digital transmission , 1996, Proceedings of Data Compression Conference - DCC '96.

[18]  V. Ralph Algazi,et al.  Analysis-based coding of image transform and subband coefficients , 1995, Optics & Photonics.