基于不规则区域分割的快速分形压缩算法

A fast algorithm of fractal image compression based on irregular region

首先基于序列块和主块之间最小象差的方差信息,提出了一方差排序搜索算法,该算法可产生与满搜索一致的分形编码.该算法能较大程度上减少对每个序列块进行搜索和匹配主块数与相应编码时间.并通过采用不规则区域变换,提出了一种不规则区域的图像分割算法,实际结果表明比传统的基于块的分割有更大的压缩比,并能减少编码时间.图4,表2,参10.

According to the minimal variance between range block and domain block, a fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper. The algorithm produces a completely identical fractal encoding to that of the conventional full search. The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by elimination domain blocks not searching. Also this paper purposes a novel algorithm for image partition using irregular region in fractal image compression, and Similar Extension algorithms are described to construct the irregular region transformations, which greatly increases the compression ratios achieved over traditional block-based partition. 4fig. ,2tab. ,10refs.