摘要
深入探讨了其吸引子相匹配的迭代系 (IFS)之间所存在的关系 ,并给出了存在这种关系的充要条件 ,进一步以此为理论基础提出了一种新的图像匹配算法 ,算法的特点在于 ,其时间复杂度与吸引子的大小、形状及复杂度无关 ,对于模式匹配、数据压缩。
The interrelations between different IFS systems with their attractor images being matching is discussed, and plenary and necessary conditions of identifying whether the given different IFS attractors are matched is provided. Furthermore , a new image matching algorithm based upon the relation proposed in this paper is put forward. The characteristic of this matching technical lies in the time complexity independent of size, shape and complexity of given images. This study is very important to module matching, data compress and generating natural scenery.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第9期1722-1725,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金资助项目 (6990 2 0 0 5 )
山东省自然科学基金资助项目 (Y2 0 0 0 G0 5 )
关键词
迭代函数系
IFS吸引子
图像匹配
iteration function systems
IFS attractor
image matching