Open Access Open Access  Restricted Access Subscription or Fee Access

Development and Performance Evaluation of Efficient Low-Complexity SPIHT Image Coder

Rajeev Mishra

Abstract


Wavelet transform is one of the advanced, effective and computationally fast methods for image data as well as video compression. The wavelet based image compression is particularly a nonreversible method that has been growing computationally more complicated as they getting more accurate and reliable. In this work we have developed an image compression technique based on main concepts related to partial ordering of the coefficients of image matrix elements by magnitude with transmission of its order by a subset partitioning approach that is replicated at the decoder thereafter the ordered bit plane transmission of
refined bits is performed and at last exploitation of the self-similarity of the image wavelet transform across different scales is applied. The partial ordering is obtained by the comparison of coefficient element magnitudes to a set of octavely decreasing thresholds. The bit pattern represents that an element is significant or insignificant for a particular selection of given threshold, depending on whether or not it is above of that threshold. This algorithm offers an excellent performance can be better understood. These concepts involves partial
ordering by magnitude with a partitioning and sorting method such that the ordered bit plane transmission and exploitation of self-similarity in between different scales of image wavelet coefficients. The proposed image compression method present a different implementation, based on set partitioning in hierarchical trees (SPIHT), which provides even better performance than already reported extension of the wavelet based compressions that surpassed the performance of the conventional methods like DCT and run length like
codlings. The image compression files results are calculated by original images for compression ratio and with reconstructed by the decompression methods for PSNR. The results are found either comparable to or surpass previous results obtained by other computationally complex methods. In addition of this the developed compression and decompression methods are very fast, and the performance can be made faster, with only small loss in performance, by reducing the bitrates values.

Cite this Article
Rajeev Mishra. Development and performance evaluation of efficient lowcomplexity SPIHT image coder. Journal of Advanced Database Management & Systems. 2015; 2(3): 5–10p.


Keywords


SPIHT, NLS, DWT, data compression, image coder

Full Text:

PDF

References


Shapiro J, Embedded image coding using zerotree of wavelet coefficients, IEEE T Signal Process. Dec. 1993; 41:3445–3462p.

Said A, Pearlman WA, A new fast and efficient codec based on set partitioning in hierarchical trees, IEEE T Circ Syst Vid. June 1996; 6: 243–250p.

Wheeler FW, Pearlman WA, SPIHT image compression without lists, IEEE conference on acoustics, speech and signal processing (ICASSP2000), May 2000; 4: 2047–2050p.

Lin WK, Burgess N, Listless zerotree coding for color image, in Proceedings of the 32nd Asilomar Conference on Signal, Systems and Computers, Nov 1998; 1: 231–235p.

Pan H, Siu WC, Law NF, A fast and low memory image coding algorithm based on lifting wavelet transform and modified SPIHT, Signal Processing Image Communication (Elsevier), 2008; 23: 146–161p.

Lian Jing, Wang Ke, Yang Jingsong, Listless Zerotree Image Compression Algorithm, in Proc. of IEEE International Conference on Signal Processing (ICSP 06), 2006.

Valens C, The Fast Lifting Wavelet Transform, A tutorial, 1999.

Keun-hyeong Park, Hyun Wook Park, Region-of-Interest coding based on Set Partitioning in Hierarchical Trees, IEEE T Circ Syst Vid. February 2002; 12(2): 106–113p.

Asad Islam, William A. Pearlman, An embedded and efficient low-complexity hierarchical image coder, Proc. SPIE 3653, Visual Communications and Image Processing '99, 294, 1998.

spiedigitallibrary.org.

Zhitao Lu, et al. Wavelet Compression of ECG signals by the Set Partitioning in Hierarchical Trees (SPIHT) Algorithm, Submitted to the IEEE T Biomed Eng.2000; 47(7): 849–856p.

Hala H. Zayed, et al. 3D Wavelets with SPIHT Coding for Integral Imaging Compression, IJCSNS International Journal of Computer Science and Network Security, January 2012; 12(1): 126p–133p.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/