A Fast and Memory Efficient SPIHT Image Encoder

スポンサーリンク

概要

• 論文の詳細を見る

• Set-partitioning in hierarchical trees (SPIHT) is one of the well-known image compression schemes. SPIHT offers an agreeable compression ratio and produces an embedded bit-stream for progressive transmission. However, the major disadvantage of SPIHT is its large memory requirement. In this paper, we propose a memory efficient SPIHT image coder and its parallel implantation. The memory requirement is reduced without sacrificing image quality. All bit-planes are concurrently encoded in order to speed up the entire coding flow. The result shows that the proposed algorithm is roughly 6 times faster than the original SPIHT. For a 512 × 512 image, the memory requirement is reduced from 5.83Mb to 491Kb. The proposed algorithm is also realized on FPGA. With pipeline design, the circuit can run at 110MHz, which can encode a 512 × 512 image in 1.438ms. Thus, the circuit achieves very high throughput, 182MPixels/sec, and can be applied to high performance image compression applications.

• 2010-03-01

著者

• Chen Zhong-ho

  Department Of Computer Science And Information Engineering National Cheng-kung University

• Su Alvin

  Department Of Computer Science And Information Engineering National Cheng-kung University

関連論文

• A Fast and Memory Efficient SPIHT Image Encoder
• VLSI Implementation of a Modified Efficient SPIHT Encoder(VLSI Architecture,VLSI Design and CAD Algorithms)
• Erratum: A Fast and Memory Efficient SPIHT Image Encoder [IEICE Transactions on Information and Systems E93.D (2010) , No. 3 pp.602-610]

スポンサーリンク