改进的SPIHT算法
Modified SPIHT algorithm
-
摘要: SPIHT算法是一种高效的嵌入式的零树编码算法,然而,它需要大量的内存空间,不利于DSP或VLSI的实现。LZC算法可以极大地降低编解码器的内存需求,但同时也降低了编解码器的性能。该文利用LZC算法的思想,改进了原来的SPIHT算法,使得在仅仅在LZC算法的内存需求基础上,达到SPIHT算法的性能要求。同时又提出了一种近似搜索算法来提高编码器的速度。
-
关键词:
- 零树编码; 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]吴乐南,数据压缩,北京,电子工业出版社,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. -
计量
- 文章访问数: 2090
- HTML全文浏览量: 87
- PDF下载量: 410
- 被引次数: 0
下载:
