改進的SPIHT算法
Modified SPIHT algorithm
-
摘要: SPIHT算法是一種高效的嵌入式的零樹編碼算法,然而,它需要大量的內(nèi)存空間,不利于DSP或VLSI的實現(xiàn)。LZC算法可以極大地降低編解碼器的內(nèi)存需求,但同時也降低了編解碼器的性能。該文利用LZC算法的思想,改進了原來的SPIHT算法,使得在僅僅在LZC算法的內(nèi)存需求基礎(chǔ)上,達到SPIHT算法的性能要求。同時又提出了一種近似搜索算法來提高編碼器的速度。
-
關(guān)鍵詞:
- 零樹編碼; SPIHT; LZC
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. -
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]吳樂南,數(shù)據(jù)壓縮,北京,電子工業(yè)出版社,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. -
計量
- 文章訪問數(shù): 2123
- HTML全文瀏覽量: 93
- PDF下載量: 413
- 被引次數(shù): 0
下載:
