基于提升小波的SPIHT改进算法  

Improvement of SPIHT algorithm based on lifting scheme

作　　者：陈红新[1] 刘正光[1] 张宏伟[1] 杨正瓴[1] 

机构地区：[1]天津大学电气与自动化工程学院,天津300072

出　　处：《计算机应用》2006年第6期1362-1364,共3页journal of Computer Applications

摘　　要：针对多级树集合分裂算法(Set Partitioning In H ierarchical Tree,SPIHT)复杂的特点,采用整数实现的提升格式代替了原来的小波变换,简化了计算过程。对小波系数采用基于块的结构划分,在频域重新建立空间方向树。根据块中相邻系数相关性建立上下文模型,对输出信息进行自适应算术编码,提高了编码效率。实验表明,在相同的比特率条件下。Due to the computational complexity of SPIHT, the integer-to-integer lifting scheme, which could simplify the computational process, was adopted instead of the normal wavelet transform. Wavelet coefficients were divided into blocks, based on which the spatial orientation trees were re-organized. The context-based model was constructed according to the correlativity of neighboring coefficients in blocks, and the outputting signals were encoded by adaptive arithmetic code to improve coding efficiency. Experiments show that the PSNR value is more than that of the original SPIHT at the same bit rate.

关 键 词：提升格式 零树 多级树集合分裂算法 上下文 算术编码 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]