基于匹配对的非规则碎片拼合算法  

Algorithm of irregular fragments merging based on matching-pairs

作　　者：赵彩虹[1] 卢章平[1] 鲁金忠[1] 

机构地区：[1]江苏大学图形技术研究所,江苏镇江210013

出　　处：《计算机应用》2005年第3期596-597,605,共3页journal of Computer Applications

基　　金：江苏大学青年基金(JDQ03003);江苏大学学生科研项目(A006)

摘　　要：介绍了基于轮廓特征的非规则碎片复原系统的模块构成,并针对碎片序列拼合模块,利用碎片间的匹配对关系,提出了一种新的碎片拼合序列遍历算法。该算法中碎片均由当前匹配碎片和另一碎片共同匹配而得,从而在后续的拼合中碎片的定位和拼合可由两碎片共同确定,这将为拼合过程提供保证。最后结合实例,进行了算法验证,取得了较好效果。The modular structure of irregular fragments reconstruction based on contour feature was introduced, and a new traversing algorithm for the sequence of fragments merging was presented. In the algorithm, the locating and merging of a fragment were determined by the current matching-fragment and another fragment, which ensured the process of fragments merging. An example was given and experiment results illustrate the algorithm efficient.

关 键 词：匹配对 轮廓特征 碎片拼合 碎片复原 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]