一种改进的分形图像压缩算法  

A Modified Fractal Image Compression Algorithm

作　　者：范广超[1] 姜其岩[2] 

机构地区：[1]贵州大学计算机科学与信息学院,贵州贵阳550025 [2]贵州大学继续教育学院,贵州贵阳550002

出　　处：《通信技术》2013年第4期109-111,共3页Communications Technology

摘　　要：为了提高分形图像压缩编码的速度,针对在基本分形图像压缩算法中值域块编码匹配搜索时需要对变换后的定义域块一一对应,导致编码时间较长的缺点,提出了一种基于菱形搜索算法的分形图像压缩编码新算法。菱形搜索算法是一种运动估计的快速搜索算法,主要过程是在所有的候选块中搜索当前块的最优匹配块。通过运用菱形搜索算法中的大小菱形模板进行匹配搜索,实验证明文中算法在提高编码速度和降低编码复杂度是有效的。In order to improve the speed of fractal image compression encoding, the range block coding matching search must realize one-to-one correspondence of the transform-domain block, this would result in fairly long encoding time in the basic fractal image compression. Thus a new fractal image coding algorithm based on diamond search algorithm is proposed, and this diamond search algorithm as a quick search algorithm based on motion estimation, mainly searches the optimal matching block of the current block in all the candidate blocks. By using the large and small diamond templates from the diamond search experiment shows that the proposed algorithm is reducing the coding complexity. algorithm, the matching search is done. The effective in improving the coding speed and

关 键 词：分形图像压缩 编码时间 菱形搜索算法 最优匹配块 

分 类 号：TP919.81[自动化与计算机技术]