Modified SPIHT algorithm

Li Honggang; Wang Qiao; Wu Lenan

Volume 24 Issue 4

Apr. 2002

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2002 > 24(4): 445-449

Li Honggang, Wang Qiao, Wu Lenan . Modified SPIHT algorithm[J]. Journal of Electronics & Information Technology, 2002, 24(4): 445-449.

Citation:

Li Honggang, Wang Qiao, Wu Lenan . Modified SPIHT algorithm[J]. Journal of Electronics & Information Technology, 2002, 24(4): 445-449.

Li Honggang, Wang Qiao, Wu Lenan . Modified SPIHT algorithm[J]. Journal of Electronics & Information Technology, 2002, 24(4): 445-449.

Citation:

Li Honggang, Wang Qiao, Wu Lenan . Modified SPIHT algorithm[J]. Journal of Electronics & Information Technology, 2002, 24(4): 445-449.

PDF( 1203 KB)

Modified SPIHT algorithm

Received Date: 2001-02-11
Rev Recd Date: 2001-07-11
Publish Date: 2002-04-19

Abstract

Abstract

Among the wavelet image coding algorithms, SPIHT is the most well-known coding algorithm because of its outstanding preformance. But it needs too many memories for hardware implementation. LZC reduces the requirement of memory as well as its preformance. In this paper, SPIHT algorithm is modified by using the idea of LZC to reduce the momery and preserve its high performance. Also an approximated algorithm is proposed to accelerate the algorithm with insignificant loss.

FullText(HTML)

References(1)

References

J. Shapiro, Embedded image coding using zerotrees of wavelet coefficients, IEEE Trans. on Signal Processing, 1993, 41(12), 3445-3462.[2]A. Said, W. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Trans. on Circuit and System for Video Technology, 1996, 6(3), 243-250.[3]吴乐南,数据压缩,北京,电子工业出版社,2000年6月,146-148.[4]W.K. Lin, N. Burgress, Listless zerotree coding for color image, In 32nd Asilomar Conference on Signals, Systems and Computer, Monterey, CA, Nov. 1998, 231-235.

Relative Articles

Supplements(0)

Cited By

Proportional views