基于慢特征分析的智能拼图算法  

Intelligence Puzzle Algorithm Based on Slow Feature Analysis

作　　者：吴娟 陈丽芳[1] WU Juan;CHEN Lifang(School of Digital Media,Jiangnan University,Wuxi,Jiangsu 214122,China)

机构地区：[1]江南大学数字媒体学院,江苏无锡214122

出　　处：《计算机工程》2019年第2期207-212,共6页Computer Engineering

基　　金：国家科技支撑计划(2015BAH54F01)

摘　　要：现有拼图算法对背景单一、存在大量相似物的图片进行组合拼接时,不能精确分辨拼图块间的微小差异,还原的图片存在偏差。为此,提出一种智能拼图算法,通过计算相邻拼图块边缘的慢特征值选择正确的拼图块,利用贪婪算法根据拼图块的邻近关系实现图片智能拼接。实验结果表明,与MGC算法相比,该算法具有更高的拼图准确率及稳定性。Existing intelligence puzzle algorithms can not restore the image well when they have a single background and a large number of similar things.Because they can not distiguish the tiny difference between puzzle block.Aiming at these problem,this paper proposes a intelligence puzzle algorithm.It selects the correct puzzle pieces by calculating the slow eigenvaluess of the edges of adjacent puzzle pieces,and then uses the greedy algorithm to realize intelligence puzzle according to the neighbor relationship of puzzle pieces.Experimental results show that the algorithm has a higher puzzle accuracy stability than the MGC algorithm.

关 键 词：智能拼图 慢特征分析 MGC算法 贪婪算法 最小生成树 

分 类 号：TP751.1[自动化与计算机技术—检测技术与自动化装置]