一种快速改进型SPIHT算法

An Approach to Modify Fast SPIHT Algorithm

  • 摘要: 在借鉴前人研究成果的基础上,对SPIHT算法进行如下改进:利用人眼视觉特性对小波系数进行加权,更加注重人的主观因素对图像压缩的影响;引入最大值表,系数扫描时只需将最大值表内相应数据同阈值进行比较;多颗空间方向树并行编码,加快算法执行速度. 实验结果表明,与传统SPIHT算法相比,该算法编解码速度加快1倍以上,更易于硬件实现. 所得重建图像具有更好的视觉感受,同时峰值信噪比平均高出0.2dB.

     

    Abstract: A fast set partitioning in hierarchical tree (SPIHT) algorithm is proposed in this paper. Compared to the typical SPIHT algorithm, three measures have been taken to speed up SPIHT algorithm. First, human visual system (HVS) is applied to weight the wavelet coefficients, and thus the impacts of subjective fators on image coding are paid more attention. Second, a list of maximum pixels is calculated and introduced so as to, in the process of scanning coefficients, only the corresponding data in such list is necessary to be compared with the threshold. Third, more than one spatial orientation trees are parallel encoded. Experimental results show that the modified SPIHT has double implementation efficiency in terms of execution time, while the reconstructed image has better visual quality with an average gain of 0.2dB PSNR.

     

/

返回文章
返回
Baidu
map