Multispectral image coding using lattice VQ and the wavelet transform

This paper examines the problem of compressing multispectral images using the wavelet transform and stack-run entropy coding. Our goal is to explore various ways of coding the wavelet coefficients in order to see which techniques can best exploit the correlation between the multispectral bands to produce an efficient coding algorithm. The results of our study indicate that applying the KLT to each subband followed by lattice VQ on Z/sup n/ and subsequent independent entropy coding of each of the lattice dimensions is an effective and fairly simple coding technique. We also demonstrate the importance of proper bit-allocation or, equivalently, the correct choice of the lattice scale parameter for each subband.

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

[2]  Michelle Effros Zerotree design for image compression: toward weighted universal zerotree coding , 1997, Proceedings of International Conference on Image Processing.

[3]  Zheng Gao,et al.  A comparison of the Z, E/sub 8/ and Leech lattices for image subband quantization , 1995, Proceedings DCC '95 Data Compression Conference.

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

[5]  Fabio Amato,et al.  Embedded zerotree wavelet coding of multispectral images , 1997, Proceedings of International Conference on Image Processing.

[6]  Min-Jen Tsai,et al.  Stack-run image coding , 1996, IEEE Trans. Circuits Syst. Video Technol..

[7]  Eve A. Riskin,et al.  Optimal bit allocation via the generalized BFOS algorithm , 1991, IEEE Trans. Inf. Theory.

[8]  Min-Jen Tsai,et al.  Stack-run coding for low bit rate image communication , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[9]  P. Schultheiss,et al.  Block Quantization of Correlated Gaussian Random Variables , 1963 .