Open Access Open Access  Restricted Access Subscription or Fee Access

Image Compression using SPIHT Algorithm- Review

M. Varathaguru, Dr. R. S. Sabeenian

Abstract


This paper studies image compression using SPIHT and Modified SPIHT algorithm. Image compression is one of the important applications in data compression on its image. Image data requires huge amount of disk space and large bandwidths for transmission. Hence, image compression is necessary to reduce the amount of data required to represent digital image.Discrete Wavelet Transform (DWT) based image compression has been paid much attention in the past decades. DWT has been adopted as a new technical standard for still image compression. Set Partitioning in Hierarchical Trees (SPIHT) is the DWT-based image compression algorithm which is more powerful, efficient and more popular, due to the properties of fast computation, low memory requirement. Discrete wavelet transform (DWT) based Set Partitioning in Hierarchical Trees (SPIHT) algorithm is widely used in many image compression systems.In this paper an attempt has been made to study the performance of Set partition in Hierarchical Tree (SPIHT) and modified SPIHT algorithms for image compression. In addition to evaluate the performance of SPIHT algorithm with Modified SPIHT, it has given reduced scan redundancy and bit redundancy.

Keywords


Discrete Wavelet Transform (DWT), Image Compression, SPIHT and Modified SPIHT.

Full Text:

PDF

References


Zhijun Fang, NaixueXiong, Laurence T. Yang, Xingming Sun, and Yan Yang,” Interpolation-Based Direction-Adaptive Lifting DWT and Modified SPIHT for Image Compression in Multimedia Communications”, IEEE systems journal, vol. 5, no. 4, december 2011.

J. M. Shapiro, “Embedded image coding using zerotrees of wavelets coefficients,” IEEE Trans. Signal Procesing, vol. 41, pp. 3445–3462, Dec. 1993.

A. Said and W. A. Pearlman, “A new, fast and efficient image codec based on set partitioning in hierarchical trees,” IEEE Trans. CircuitsSyst. Video Technol., vol. 6, pp. 243–250, June 1996.

Kai Liu, EvgeniyBelyaev, and JieGuo, “VLSI Architecture of Arithmetic Coder Used in SPIHT’’ ,IEEE transactions on very large scale integration (vlsi) systems, vol. 20, no. 4, april 2012.

Nivedita,Sonika Jindal,” Performance Analysis of SVD and SPIHT Algorithm for Image Compression Application,” International Journal of Advanced Research in Computer Science and Software Engineering,Volume 2, Issue 2, February 2012.

Stefan Strahl, Heiko Hansen, and Alfred Mertins,” A Dynamic Fine-Grain Scalable Compression Scheme With Application to Progressive Audio Coding,” IEEE transactions on audio, speech, and language processing, vol. 19, no. 1, january 2011.

Garima Chopra and A. K. Pal, “An Improved Image Compression Algorithm Using Binary Space Partition Scheme and Geometric Wavelets,” IEEE transactions on image processing, vol. 20, no. 1, january 2011.

Zhou Wang, Alan Conrad Bovik,” Embedded Foveation Image Coding,” IEEE transactions on image processing, vol. 10, no. 10, october 2001.

Changhe Song, Yunsong Li, and Bormin Huang,” A GPU Accelerated Wavelet Decompression System with SPIHT and Reed-Solomon Decoding for Satellite Images”, IEEEjournal of selected topics in applied earth observations and remote sensing, vol. 4, no. 3, september 2011.

K. Siva Nagi Reddy, B. Raja Sekher Reddy, G. Rajasekhar and K. Chandra Rao,”A Fast Curvelet Transform Image Compression Algorithm using with Modified SPIHT,” International Journal of Computer Science and Telecommunications ,Volume 3, Issue 2, February 2012.

A. A. Kassim, N. Yan, and D. Zonoobi, “Wavelet packet transform basis selection method for set partitioning in hierarchical trees,” J. Electron.Imag., vol. 17, no. 3, p. 033007, Jul. 2008.

M. A. Ansari and R. S. Ananda, “Context based medical image compressionfor ultrasound images with contextual set partitioning in hierarchicaltrees algorithm,” Adv. Eng. Softw., vol. 40, no. 7, pp. 487–496,Jul. 2009.

M. Akter, M. B. I. Reaz, F. Mohd-Yasin, and F. Choong, “A modified-set partitioning in hierarchical trees algorithm for real-time imagecompression,” J. Commun. Technol. Electron., vol. 53, no. 6, pp.642–650, Jun. 2008.

F. W. Wheeler and W. A. Pearlman, “SPIHT image compression without lists,” in Proc. IEEE Int. Conf. Acoust., Speech, SignalProcess., Istanbul, Turkey, Jun. 2000, pp. 2047–2050.

M. Antonini, M. Barland, P. Mathieu, and I. Daubechies, “Image coding using the wavelet transform,” IEEE Trans. Image Process, vol. 1, no. 2, pp. 205–220, Apr. 1992.

S. Grgic, M. Grgic, and B. Zovko-Cihlar, “Performance analysis of image compression using wavelets,” IEEE Trans. Indust. Electron., vol. 48, no. 3, pp. 682–695, Jun. 2001.

M. L. Hilton, B. O. Jawerth, and A. Sengupta, “Compressing still and moving images with wavelets,” Multimedia Syst., vol. 2, no. 5, pp. 218– 227, 1994.

F. S. Al-Kamali, M. I. Dessouky, B. M. Sallam, F. Shawki, and F. E. A. El-Samie, “Transceiver scheme for single-carrier frequency division multiple access implementing the wavelet transform and peakto- average-power ratio reduction methods,” IET Commun., vol. 4, no. 1, pp. 69–79, Jan. 2010.

D. Taubman and M. W. Marcellin, JPEG2000 Image Compression: Fundamentals, Standards and Practice. Dordrecht, The Netherlands: Kluwer, 2002.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.