二维碎片拼接的局部匹配  

Local matching for 2-D fragments reassembling

作　　者：房然然[1] 黄发忠[1] 辛化梅[1] 

机构地区：[1]山东师范大学物理与电子科学学院,山东济南250014

出　　处：《现代电子技术》2015年第9期54-56,共3页Modern Electronics Technique

基　　金：教育部留学回国人员科研启动基金项目(教外司留2009-36);山东省优秀中青年科学家科研奖励基金(BS2013DX035);国家自然科学基金(61401259)

摘　　要：基于轮廓的二维非规则碎片拼接问题,通常分为局部匹配和全局匹配两个步骤,这里提出一种新的局部匹配的方法,首先对轮廓进行多边形逼近得到多边形顶点序列,然后获取多边形顶点的转角序列特征并计算相邻顶点间长度,对该转角序列使用改进过的"坦克算法",应用一定筛选规则,寻找到多边形顶点的若干候选匹配信息。改进的算法可降低时间复杂度,提高匹配效率。The 2？D irregular fragments reassembling issue based on contour is usually divided into two steps：local matching and global matching. A new local matching method based on improved Tank algorithm is proposed. Firstly the sequence of polygon vertices is obtained by polygonal approximation to the contour,then the corner sequence signature of the polygon is acquired, the distance between two adjacent vertices is calculated. The improved Tank algorithm is applied in the corner sequence to find some candidate matching information of the polygon vertices by some screening rules. The improved algorithm can reduce time complexity and improve matching efficiency.

关 键 词：碎片拼接 多边形逼近 旋转角度 局部匹配 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP391[自动化与计算机技术—计算机科学与技术]