方差排序及相似膨胀分形压缩  

Fractal Compression of Order by Variance and Similar Extension

作　　者：华臻[1] 范辉[2] 范策[2] 李晋江[3] 刘敬云[3] 

机构地区：[1]烟台大学光电信息学院,烟台264005 [2]烟台大学计算机学院,烟台264005 [3]太原理工大学计算机系,太原030024

出　　处：《计算机工程与应用》2003年第19期106-108,117,共4页Computer Engineering and Applications

基　　金：山东省自然科学基金(编号:Y2002G08)

摘　　要：该文就分形图像压缩中搜索与匹配过程的相似性,基于序列块和主块之间当前最小像差的方差信息,提出了一方差排序算法,该算法大大减少了对每个序列块进行搜索和匹配的主块数与相应的编码时间。同时又提出了一种不规则区域的图像分割算法,它比传统的基于块的分割获得了更大的压缩率。这两种算法结合使用可在较短的编码时间获得较高的压缩率。A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper.Using the current minimum distortion and variance difference between the range block and domain block,algorithm of order by variance is proposed.A novel algorithm for image partition using irregular region is also purposed,which greatly increases the compression ratios achieved over traditional block-based partition.Using the two algorithms together people can get higher compression ratios in less encoding time.

关 键 词：对比度 方差 方差排序 不规则区域 相似膨胀 

分 类 号：TP317[自动化与计算机技术—计算机软件与理论]