摘要： 为在保持多级树集合分裂(SPIHT)算法编码速度的同时提高其性能，提出一种基于二叉树的改进SPIHT算法。对D型集合分裂得到的4个系数进行二叉树编码，优先编码L型集合的重要性，并以较高的概率提前判断二叉树根节点的重要性，从而提高编码效率。实验结果表明，该算法的执行速度与SPIHT算法相当，且具有较高的峰值信噪比。

关键词: 图像压缩, 多级树集合分裂, 零树编码, 嵌入式编码, 二叉树编码, 小波变换

Abstract: In order to raise the performance of Set Partitioning in Hierarchical Trees(SPIHT) algorithm and maintain the encoding speed, an improved SPIHT algorithm based on binary tree is proposed. Four coefficients splited by D-type sets are coded by binary tree. Through coding the significance of L-type sets first, the algorithm can determine the significance of the root of the binary tree in advance with high probability, so as to further improve the coding efficiency. Experimental results show that the speed of the proposed algorithm is as fast as SPIHT algorithm, and it can improve Peak Signal to Noise Ratio(PSNR).

Key words: image compression, Set Partitioning in Hierarchical Trees(SPIHT), zero tree coding, embedded coding, binary tree coding, wavelet transform

中图分类号: 

• TP391