A fast and low memory image coding algorithm based on lifting wavelet transform and modified SPIHT

Due to its excellent rate-distortion performance, set partitioning in hierarchical trees (SPIHT) has become the state-of-the-art algorithm for image compression. However, the algorithm does not fully provide the desired features of progressive transmission, spatial scalability and optimal visual quality, at very low bit rate coding. Furthermore, the use of three linked lists for recording the coordinates of wavelet coefficients and tree sets during the coding process becomes the bottleneck of a fast implementation of the SPIHT. In this paper, we propose a listless modified SPIHT (LMSPIHT) approach, which is a fast and low memory image coding algorithm based on the lifting wavelet transform. The LMSPIHT jointly considers the advantages of progressive transmission, spatial scalability, and incorporates human visual system (HVS) characteristics in the coding scheme; thus it outperforms the traditional SPIHT algorithm at low bit rate coding. Compared with the SPIHT algorithm, LMSPIHT provides a better compression performance and a superior perceptual performance with low coding complexity. The compression efficiency of LMSPIHT comes from three aspects. The lifting scheme lowers the number of arithmetic operations of the wavelet transform. Moreover, a significance reordering of the modified SPIHT ensures that it codes more significant information belonging to the lower frequency bands earlier in the bit stream than that of the SPIHT to better exploit the energy compaction of the wavelet coefficients. HVS characteristics are employed to improve the perceptual quality of the compressed image by placing more coding artifacts in the less visually significant regions of the image. Finally, a listless implementation structure further reduces the amount of memory and improves the speed of compression by more than 51% for a 512x512 image, as compared with that of the SPIHT algorithm.

[1]  R.R. Shively,et al.  Generalizing SPIHT: a family of efficient image compression algorithms , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[2]  Wan-Chi Siu,et al.  Successive structural analysis using wavelet transform for blocking artifacts suppression , 2001, Signal Process..

[3]  Wan-Chi Siu,et al.  An efficient computational scheme for the two-dimensional overcomplete wavelet transform , 2002, IEEE Trans. Signal Process..

[4]  Heinz-Otto Peitgen,et al.  Fast variable run-length coding for embedded progressive wavelet-based image compression , 2001, IEEE Trans. Image Process..

[5]  W. Sweldens.  The Lifting Scheme: A Custom - Design Construction of Biorthogonal Wavelets "Industrial Mathematics , 1996 .

[6]  Nariman Farvardin,et al.  A perceptually motivated three-component image model-part II: applications to image compression , 1995, IEEE Trans. Image Process..

[7]  Wen-Kuo Lin,et al.  Listless zerotree coding for color images , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[8]  Wim Sweldens,et al.  Lifting scheme: a new philosophy in biorthogonal wavelet constructions , 1995, Optics + Photonics.

[9]  Wan-Chi Siu,et al.  Progressive image coding based on visually important features , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[10]  Nariman Farvardin,et al.  A perceptually motivated three-component image model-Part I: description of the model , 1995, IEEE Trans. Image Process..

[11]  I. Daubechies,et al.  Factoring wavelet transforms into lifting steps , 1998 .

[12]  William A. Pearlman,et al.  SPIHT image compression without lists , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

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

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

[15]  Stéphane Mallat,et al.  Characterization of Signals from Multiscale Edges , 2011, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  David S. Taubman,et al.  High performance scalable image compression with EBCOT , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[17]  Mingui Sun,et al.  Fast Internet transmission of physiological signals using the lifting scheme and SPIHT coding algorithm , 2002, 6th International Conference on Signal Processing, 2002..

[18]  John D. Villasenor,et al.  Visibility of wavelet quantization noise , 1997, IEEE Transactions on Image Processing.

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

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

[21]  Benjamin Belzer,et al.  Wavelet filter evaluation for image compression , 1995, IEEE Trans. Image Process..

[22]  Wim Sweldens,et al.  The lifting scheme: a construction of second generation wavelets , 1998 .

[23]  William A. Pearlman,et al.  Embedded and efficient low-complexity hierarchical image coder , 1998, Electronic Imaging.

[24]  William A. Pearlman,et al.  Efficient, low-complexity image coding with a set-partitioning embedded block coder , 2004, IEEE Transactions on Circuits and Systems for Video Technology.

[25]  Faouzi Kossentini,et al.  Reversible integer-to-integer wavelet transforms for image compression: performance evaluation and analysis , 2000, IEEE Trans. Image Process..

[26]  J. M. Shapiro.  A fast technique for identifying zerotrees in the EZW algorithm , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.