基于自适应编码次序的多级树集合分裂算法  

Improved set partitioning in hierarchical trees algorithm based on adaptive coding order

作　　者：黄可坤[1] 

机构地区：[1]嘉应学院数学学院,广东梅州514015

出　　处：《计算机应用》2012年第3期732-735,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(11001107)

摘　　要：为了在图像轮廓处获得更好的压缩效果,在多级树集合分裂(SPIHT)算法的基础上提出了一种优先编码周围邻域中重要系数较多的系数与集合的小波图像压缩算法。在编码之前对系数或集合按照周围重要系数的个数进行排序,而且在扫描完周围有重要系数的集合后,就精细扫描已经得到的重要系数。这种编码次序是自适应确定的,不需要任何额外的存储空间,而且在到达指定压缩比时能够编码更多的重要系数。实验结果表明,对比原来的SPIHT算法,该方法能提高峰值信噪比并改善主观视觉感受。In order to obtain better compression on image edge,an improved Set Partitioning In Hierarchical Trees（SPIHT） algorithm based on prior scanning the coefficients around which there were more significant coefficients was proposed.The coefficients or sets were sorted according to the number of surrounding significant coefficients before being coded,and the previous significant coefficients were refined as soon as the sets around which there existed any significant coefficients had been scanned.The scanning order was confirmed adaptively and did not need any extra storage.It can code more significant coefficients at a specified compression ratio.The experimental results show that the method can improve PSNR and the subjective visual experience compared with SPIHT.

关 键 词：图像压缩 多级树集合分裂算法 自适应扫描次序 小波变换 人类视觉系统 

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