非线性分形图像压缩编码的优化  

An Improved Nonlinear Algorithm Based on Fractal Image Compression Coding

作　　者：赵德平[1] 孙丽娟[1] 艾金城[1] 杨迁[1] 

机构地区：[1]沈阳建筑大学信息与控制工程学院,辽宁沈阳110168

出　　处：《沈阳建筑大学学报（自然科学版）》2004年第4期334-336,共3页Journal of Shenyang Jianzhu University：Natural Science

基　　金：沈阳市科学技术局(1022038-1-04)

摘　　要：从减少搜索匹配块的数目入手,提出了一种旨在降低分形编码的复杂度,缩短编码时间的分形图像压缩的改进算法.提高了经典分形编码的压缩效率,并且保证获得高质量的重建图像.本算法采用了将方块转换为圆盘的方式来完成值域块与定义域块的匹配,扩充了编码字典.同时,对圆盘匹配中最大旋转角度进行了概率上的最优定位,优化了搜索块的范围,缩短了块的匹配时间.实验结果表明,本算法简单、有效,并具有良好的压缩结果和高质量的重建图像.The author begins with this facet of the algorithm which can reduce the number of the matching of blocks in the process of the search,and therefore designs an optimized fractal image compression algorithm which aims to decrease the complexity of the fractal encoding and reduce encoding time.Its purpose enhances the fractal compression encoding efficiency and has high quality rebuilding image.The algorithm completes the matching of the range and domain block by way of transforming the square to the disk,and expands the encoding dictionary.Meanwhile,it locates the maximum rotating angle probability in the matching of disks in order to optimize the range of the searched block and save on the matching of time.The experimental results show that algorithm is very simple and has better compression results and high quality rebuilding image.

关 键 词：非线性分形图像 图像压缩 编码 解码 

分 类 号：TN919.81[电子电信—通信与信息系统]