Wavelet Image Compression

Publisher Summary This chapter provides the simple high-level insights, based on the intuitive concept of time frequency representations, into why wavelets are good for image coding. As a way of highlighting the benefits of having a sparse representation, such as that provided by the wavelet decomposition, consider the lowest frequency band in the top level of the three-level wavelet hierarchy. This band is just a down sampled and smoothed version of the original image. A very simple way of achieving compression is to simply retain this lowpass version and throw away the rest of the wavelet data, instantly achieving a compression ratio of 64:1. Another attractive aspect of the coarse-to-fine nature of the wavelet representation naturally facilitates a transmission scheme that progressively refines the received image quality. That is, it would be highly beneficial to have an encoded bitstream that can be chopped off at any desired point to provide a commensurate reconstruction image quality. This is known as a progressive transmission feature or as an embedded bitstream. This is ideally suited, for example, to Internet image applications. These are some of the high-level reasons why wavelets represent a superior alternative to traditional Fourier-based methods for compressing natural images: that is why the Joint Photographic Experts Group 2000 standard uses wavelets instead of the Fourier-based discrete cosine transform.

[1]  Zixiang Xiong,et al.  Adaptive transforms for image coding using spatially varying wavelet packets , 1996, IEEE Trans. Image Process..

[2]  Claude E. Shannon,et al.  A mathematical theory of communication , 1948, MOCO.

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

[4]  Michael W. Marcellin,et al.  JPEG2000: standard for interactive imaging , 2002, Proc. IEEE.

[5]  Herbert Gish,et al.  Asymptotically efficient quantizing , 1968, IEEE Trans. Inf. Theory.

[6]  Mihaela van der Schaar,et al.  Interframe wavelet coding - motion picture representation for universal scalability , 2004, Signal Process. Image Commun..

[7]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

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

[9]  David S. Taubman,et al.  High performance scalable image compression with EBCOT. , 2000, IEEE transactions on image processing : a publication of the IEEE Signal Processing Society.

[10]  Nariman Farvardin,et al.  Optimum quantizer performance for a class of non-Gaussian memoryless sources , 1984, IEEE Trans. Inf. Theory.

[11]  K Ramchandran,et al.  Best wavelet packet bases in a rate-distortion sense , 1993, IEEE Trans. Image Process..

[12]  David S. Taubman,et al.  Highly scalable video compression with scalable motion coding , 2003, IEEE Transactions on Image Processing.

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

[14]  Michael W. Marcellin,et al.  Trellis coded quantization of memoryless and Gauss-Markov sources , 1990, IEEE Trans. Commun..

[15]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[16]  Ajay Luthra,et al.  Overview of the H.264/AVC video coding standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[17]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[18]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[19]  John W. Woods,et al.  Embedded video coding using invertible motion compensated 3-D subband/wavelet filter bank , 2001, Signal Process. Image Commun..