摘要
对简库恩的基本分形图像压缩算法进行了改进·从减少不必要的计算量入手,提出基于误差阈值的分形图像压缩算法·首先给定一误差阈值,然后计算子块与父块间有限个对应像素点之间的灰度误差累计和,得到超过误差阈值的最大计算次数,据此找到与子块最相似的父块,达到图像压缩的目的·实验表明,该算法能明显缩短图像压缩的时间,而信噪比和压缩比变化不大·
?Starting from reducing the unnecessary computation,the basic fractal image compression's algorithm introduced by A.E. Jacquin is improved with a novel fractal image compression algorithm proposed on an error threshold basis. Briefly,a fixed error threshold is given to compute the total accumulative pixel error of corresponding finite pixels between the child blocks and father blocks,which is then used to find the father block most similar to child block. The aim of image compression can thus come true. Experiments indicate that the proposed algorithm can obviously shorten the time of fractal image compression with little changes in compress and signal-to-noise ratios.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2003年第12期1161-1164,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(69974008)
教育部博士学科点专项科研基金资助项目(2000014512)
关键词
分形
压缩映射
迭代函数系统
图像压缩
误差阈值
fractal
compression mapping
IFS(iterated function system)
image compression
error threshold
