| 基于轮廓线匹配的2-D碎片拼接研究 |
| |
| 引用本文： | 茹少峰,周明全.基于轮廓线匹配的2-D碎片拼接研究[J].计算机应用与软件,2008,25(3):83-85. |
| |
| 作者姓名： | 茹少峰 周明全 |
| |
| 作者单位： | 1. 西北大学经济管理学院,陕西,西安,710069
2. 北京师范大学信息科学与技术学院,北京,100875 |
| |
| 摘 要： | 分析了数量较多时不规则形状的2D碎片拼接的困难性,提出2D碎片的拼接策略,先通过轮廓线匹配进行局部形状匹配;然后通过全局搜索拼接重构物体形状,由于匹配的特征集选择了带有几何结构属性的连接点,优点是不仅局部匹配的速度提高而且全局拼接重构的有效性提高.试验对比表明提出的算法更有效.
|
| 关 键 词： | 轮廓线 匹配 拼接 |
| 收稿时间： | 2006-04-25 |
| 修稿时间： | 2006年4月25日 |
STUDY ON 2-D FRAGMENTS RE-ASSEMBLY BASED ON CONTOUR MATCHING |
| |
| Ru Shaofeng,Zhou Mingquan.STUDY ON 2-D FRAGMENTS RE-ASSEMBLY BASED ON CONTOUR MATCHING[J].Computer Applications and Software,2008,25(3):83-85. |
| |
| Authors: | Ru Shaofeng Zhou Mingquan |
| |
| Affiliation: | Ru Shaofeng1 Zhou Mingquan21(College of Economic Management,Northwest University,Xi'an 710069,Shaanxi,China)2(College of Information Science , Technology,Beijing Normal University,Beijing 100875,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | Contour Matching Re-assembly |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
