摘要
目前全自动分形编码的实现都是基于简库恩算法的定义域、值域匹配搜索来进行的。编码时间过长是其主要缺点之一。现代优化算法主要研究用数学方法去迅速寻找离散事件的最优编排、分组、次序或筛选。本文将现代优化算法中的局部搜索法与分形编码结合起来,从而达到在解码图像质量相当时使编码速度提高、或编码速度相当时使图像质量提高的目的。
At present the implementation of fractal image coding is based on the matching search of Jacquin's algorithm. The main shortcoming of this method is that the coding time is too long. Modern search algorithm mainly concerned about finding the best arranging, grouping, and selecting of events. In this paper, the local search algorithm is combined with fractal image coding, so as to improve the coding time at equal peak signal noise ration, or improve the recovery image quality at the same coding time.
关键词
分形
图像编码
现代优化算法
局部搜索算法
fractal
image coding
modern search algorithm
local search algorithm
