基于轮廓线匹配的2-D碎片拼接研究  

STUDY ON 2-D FRAGMENTS RE-ASSEMBLY BASED ON CONTOUR MATCHING

作　　者：茹少峰[1] 周明全[2] 

机构地区：[1]西北大学经济管理学院,陕西西安710069 [2]北京师范大学信息科学与技术学院,北京100875

出　　处：《计算机应用与软件》2008年第3期83-85,共3页Computer Applications and Software

基　　金：陕西省教育厅专项基金资助项目(05jk300)

摘　　要：分析了数量较多时不规则形状的2D碎片拼接的困难性,提出2D碎片的拼接策略,先通过轮廓线匹配进行局部形状匹配;然后通过全局搜索拼接重构物体形状,由于匹配的特征集选择了带有几何结构属性的连接点,优点是不仅局部匹配的速度提高而且全局拼接重构的有效性提高。试验对比表明提出的算法更有效。The difficulty of re-assembly of a large number of irregular fragments is analyzed, and a policy for 2-D fragments re-assembly is presented. Local shape matching is carried out by contour matching,and the shape of objects is reconstructed through global search and re-assembly. The junctions with the attribute of polygonal arcs are selected by feature sets. The speed of local matching is enhanced, and the validity of global re-assembly and reconstruction is improved. The experiment shows that the algorithm is effective.

关 键 词：轮廓线 匹配 拼接 

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