适用于硬件实现的零树编码算法

Zerotree Coding Algorithm for Hardware Implementation

在 L istless Zerotree Coding(L ZC)算法的基础上提出了一种内存空间更小的静止图像零树编码算法 ,该算法与 SPIHT等经典的零树编码算法的区别在于编解码过程中不使用列表结构 ,与 L ZC算法相比则节约了两个位图 (BitMap) ,而这些位图为编码算法提供了重要系数和重要后代集合的位置信息 .实验结果证明 ,本文的算法在不降低图像质量的前提下大大降低了零树编码算法的内存要求 。

This paper introduces a reduced memory still image compression algorithm based on Listless Zerotree Coding(LZC). The difference between the algorithm and SPIHT is uses no lists during coding and decoding, and it only use no bit maps to store the position of signification coefficients and descendant sets. The result of the experiment shows our approach significantly reduced memory requirement and no reducing the quality of the reconstructed image.