The week's pick
Reseach Article
A Memory Efficient and Faster Modification of Set Partitioning In Hierarchical Trees (SPIHT) Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 65 - Number 10 |
| Year of Publication: 2013 |
| Authors: Abdur Rahman Bin Shahid, Shahriar Badsha, Md. Didarul Islam |
10.5120/10957-5923
|
Abdur Rahman Bin Shahid, Shahriar Badsha, Md. Didarul Islam . A Memory Efficient and Faster Modification of Set Partitioning In Hierarchical Trees (SPIHT) Algorithm. International Journal of Computer Applications. 65, 10 ( March 2013), 1-5. DOI=10.5120/10957-5923
Abstract
The introduction of the zero-tree wavelet image coding technique has leaded to the development of many new and powerful coding algorithms based on its theory. Because of simplicity and coding efficiency, Said and Pearlman's Set Partitioning In Hierarchical Trees (SPIHT) algorithm is treated as one of the most significant among these algorithms. However the high memory requirement and time-consuming computation of its three linked lists are its major drawbacks for hardware implementation. Moreover, in the presence of noise it's extremely sensitive to sign bit error. An error in sign bit of a coefficient causes significant reduction to image quality. In this paper a modification of SPIHT (LMFS) for low memory implementation is proposed which replaces the three linked lists of SPIHT with a state map saving memory space and computation time. A sign map is also introduced to deal with sign bit errors. Experimental results show that under the same condition, LMFS maintains the quality of reconstructed image almost same as SPIHT and is suitable for real time and low memory implementation.
References
- A. S. Lewis and G. Knowles, "Image compression using the 2-D wavelet transform," IEEE Trans. Image Processing, vol. 1, pp. 244–250, Apr. 1992.
- J. M. Shapiro, "Embedded image coding using zerotrees of wavelet coefficients," IEEE Trans. Signal Processing, 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. Circuits, Syst. , Video Technol. , vol. 6, pp. 243–250, June 1996.
- W. K. Lin and N. Burgess, "Listless zerotree coding for color images", in Proc. Of the 32th Asilomar Conf. on Signals Systems and Computers, vol. 1, pp. 231-235, November 1998.
- W. K. Lin and N. Burgess, "3D listless zerotree coding for low bit ratio video", in Proc. Of the International Conf. on Image Processing, October, 1999.
- F. W. Wheeler and W. A. Pearlman, "SPIHT image compression without lists", in Proc. Of IEEE International Conf. on Acoustics, Speech, and Signal Processing, vol. 4, 2000.
- W. B. Huang, W. Y. SU. Alvin and Y. H. Kuo, "VLSI implementation of a modified efficient SPIHT Encoder", IEICE Trans. Fundamentals, vol. E89-A, No. 12, December, 2006.
- M. Sakalli, W. A. Pearlman and M. Farshchian, "SPIHT algorithm using depth first search algorithm with minimum memory usage", 40th Annual Conf. on Information Science and Systems,pp. 1158-1163, 2006.
- Sun Yong, Zhang Hui, and Hu Guangshu, "Real-time implementation of a new low-memory SPIHT image coding algorithm using DSP chip," IEEE Trans. Image Processing, vol. 9, pp. 1112-1115, Nov, 2002.
Index Terms
Keywords