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

二维轮廓曲线匹配算法研究
引用本文:钱文光,林小竹,赵国庆. 二维轮廓曲线匹配算法研究[J]. 北京石油化工学院学报, 2007, 15(3): 8-12
作者姓名:钱文光  林小竹  赵国庆
作者单位:北京化工大学信息科学与技术学院,北京,100029;北京石油化工学院自动化系,北京,102617
摘    要:在分析平面曲线的几何特性的基础上,提出了一种快速有效的轮廓曲线匹配算法.该算法在取得轮廓曲率集合和角点集合的基础上,首先根据角点的曲率值搜索初始匹配角点,得到初始匹配段.其次利用曲线段的几何属性-弧长和弦长来判断初始匹配段,如果满足条件,则将初始匹配段作为候选匹配段.最后应用候选匹配曲线段上曲率的Hausdorff距离来验证曲线段的匹配,如果该距离在一定的容差范围内,则该曲线段匹配.实验证明该算法即保证了较好的匹配精度,又能显著提高匹配的速度.

关 键 词:角点检测  曲率计算  Hausdorff距离  轮廓匹配
修稿时间:2007-06-04

Research on the Alogrithm for Matching 2D Contours
Qian Wenguang,Lin Xiaozhu,Zhao Guoqing. Research on the Alogrithm for Matching 2D Contours[J]. Journal of Beijing Institute of Petro-Chemical Technology, 2007, 15(3): 8-12
Authors:Qian Wenguang  Lin Xiaozhu  Zhao Guoqing
Abstract:On the basis of analysis of geometric feature of plane curve,an algorithm for matching contours is introduced in this paper.In the process,the initial matching pair is firstly determined based on the curvature set and the corners set.Next,the initial matching pair is validated by the geometry attribute.If the length of the arc and chord of the initial pair segments is in the range of error permission,the two segments can be determined as the candidate matching pair.Finally,the Hausdorff distance between the candidate matching pair is calculated.If the distance is in the range of admitting error,the segments can be determined as a matching pair.The method is proved to be effective by realistic experiments.
Keywords:corner detection  curvature calculation  hausdorff distance  contour matching
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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