基于匹配概率活动表的分形图像快速压缩编码算法  

A FAST FRACTAL IMAGE COMPRESSION ALGORITHM BASED ON MATCHING PROBABILITY TABLE

作　　者：马燕[1] 李顺宝 

机构地区：[1]上海师范大学计算机系,上海200234

出　　处：《计算机应用与软件》2005年第4期105-106,92,共3页Computer Applications and Software

摘　　要：本文在Jacquin提出的自动分形图像编码算法的基础上,针对各定义域块与值域块的匹配概率不相等,提出了基于匹配概率活动表的分形编码算法,为进一步加快编码速度,从理论上重新定义了定义域块与值域块间距离的计算,并分析了值域块类型与门限取值间的关系,并经实验给出了门限的具体数值。实验结果表明,与基本自动分形图像编码方法相比,在保持重建图像质量的前提下,运算时间大大下降,加快了分形图像压缩速度。Based on the automatic fractal image coding algorithm proposed by Jacquin,this paper presents fractal image coding algorithm based on matching probability table,due to the inequality of matching probability between domain block and range block.The distance between domain block and range block is redefined in theory to accelerate image coding.The relationship between the type of range block and threshold is analyzed,the value of threshold is also given by experiments.Experimental results show that compared with basic automatic fractal image coding method,this new approach needs less computation time with no obvious depression on the quality of the reconstructed image and speeds up the fractal image coding.

关 键 词：分形图像 匹配概率 压缩编码算法 活动 图像编码算法 分形编码算法 定义域块 值域块 编码速度 编码方法 图像质量 运算时间 压缩速度 新定义 自动 门限 实验 数值 

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