Real-time implementation of a new low-memory SPIHT image coding algorithm using DSP chip
暂无分享,去创建一个
Among all algorithms based on wavelet transform and zerotree quantization, Said and Pearlman's (1996) set partitioning in hierarchical trees (SPIHT) algorithm is well-known for its simplicity and efficiency. This paper deals with the real-time implementation of SPIHT algorithm using DSP chip. In order to facilitate the implementation and improve the codec's performance, some relative issues are thoroughly discussed, such as the optimization of program structure to speed up the wavelet decomposition. SPIHT's high memory requirement is a major drawback for hardware implementation. In this paper, we modify the original SPIHT algorithm by presenting two new concepts-number of error bits and absolute zerotree. Consequently, the memory cost is significantly reduced. We also introduce a new method to control the coding process by number of error bits. Our experimental results show that the implementation meets common requirement of real-time video coding and is proven to be a practical and efficient DSP solution.
[1] Jerome M. Shapiro,et al. Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..
[2] Michael T. Orchard,et al. Space-frequency quantization for wavelet image coding , 1996, Optics & Photonics.
[3] William A. Pearlman,et al. A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..
[4] Adrian S. Lewis,et al. Image compression using the 2-D wavelet transform , 1992, IEEE Trans. Image Process..