首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于轮廓线匹配的2D碎片物体复原方法
引用本文:茹少峰,杜建丽,耿国华.基于轮廓线匹配的2D碎片物体复原方法[J].西北大学学报,2004,34(3):275-278,293.
作者姓名:茹少峰  杜建丽  耿国华
作者单位:[1]西北大学计算机科学系,陕西西安710069 [2]西安石油学院信息科学系,陕西西安710065
基金项目:国家自然科学基金资助项目(60271032),陕西省教育厅专项基金资助项目(03JK155)
摘    要:目的 为了快速地进行2D碎片物体的复原。方法 采用一种基于轮廓线匹配的2D碎片物体的复原方法,轮廓线用多边形逼近表示。这一表示在旋转和平移变换下是不变的。将多边形的本质参数连接点作为匹配的特征集,并采用对特征集排序方法提高了匹配速度。结果 所给出的匹配算法有效,有一定的实用价值。结论 基于保持几何属性和拓扑属性的特征选取,使得多边形的匹配变为1D字符的匹配,从而使得2D碎片物体的复原简单、快速。

关 键 词:多边形逼近  连接点  特征集  匹配  复原
文章编号:1000-274X(2004)03-0275-05

The method of recovering 2-D fragments by contour matching
RU Shao-feng,DU Jian-li,GENG Guo-hua.The method of recovering 2-D fragments by contour matching[J].Journal of Northwest University(Natural Science Edition),2004,34(3):275-278,293.
Authors:RU Shao-feng  DU Jian-li  GENG Guo-hua
Institution:RU Shao-feng~1,DU Jian-li~2,GENG Guo-hua~1
Abstract:AimA fast method for recovering 2D fragments is investigated.MethodsThe method for recovering fragments by contour matching is presented.Contours are approximations by polygon,this representation is invariant to translation and rotation transformation. The polygon junction is defined.It is viewed as feature sets. A fast algorithm matching is adopted by using ordered list.ResultsExperiments show that the matching algorithm is efficient and has application in recovering 2D fragments.ConclusionPolygonal Junction is viewed as feature sets; the benefits of using this feature sets include attribute of geometry and structure of topology of polygon.The 2D polygon matching task is reduce into a 1 D string-matching problem so that the recovering 2D fragments is easy and the processing time is greatly saved.
Keywords:polygonal approximation  junction  feature sets  matching  recovering
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号