摘要
本文提出了一种基于优选匹配的快速分行编码算法,该算法利用分形编码值-域排除条件,在三行邻域内搜索最优匹配快,有效避免了大量的值-域匹配计算,缩短了编码时间,实验结果表明,该方法可以缩短编码时间97％左右,而重构图像质量没有受到影响．
In order to improve the speed in fractal coding, a new fast fractal image coding algorithm based on optimum matching is presented in this paper. The algorithm can avoid a large number of range-domain block matches when searching the best matched domain block in its 3-line neighborhood with kick-out condition, and can greatly reduce the computation or the coding time. Experimental results show that the coding time can be reduced by 97% while the quality of reconstructed image is not much influenced.
出处
《数值计算与计算机应用》
CSCD
2006年第1期24-30,共7页
Journal on Numerical Methods and Computer Applications
关键词
分形编码
排除条件
三行领域
最优匹配
fractal image coding, kick-out condition, 3-line neighborhood,optimum matching
