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

基于Hausdorff距离的2D形状匹配改进算法
引用本文:张文景,许晓鸣,苏键锋.基于Hausdorff距离的2D形状匹配改进算法[J].中国图象图形学报,2000,5(2):106-109.
作者姓名:张文景  许晓鸣  苏键锋
作者单位:上海交通大学自动化系智能控制研究室!上海200030
基金项目:上海市科技发展基金资助项目!( 95 11110 5 2 )
摘    要:在计算机视觉检测中,常常需要将两幅图象在空间上配准,以便进行后续的检测过程,该文提出将Hausdorff距离作为物体轮廓相似性的测度,并用遗传算法进行最佳形状匹配的快速搜索,根据遗传搜索的结果再进行一次线性搜索,从而提高解的精度,实验结果证明了该方法能快速,精确地对两幅2D形状进行匹配。

关 键 词:形状匹配  遗传算法  计算机视觉检查  图象配准
收稿时间:1998/12/29 0:00:00
修稿时间:1998-12-29

An Improved Algorithm for 2D Shape Matching Based on Hausdorff Distance
ZHANG Wen-jing,XU Xiao-ming and SU Jian-feng.An Improved Algorithm for 2D Shape Matching Based on Hausdorff Distance[J].Journal of Image and Graphics,2000,5(2):106-109.
Authors:ZHANG Wen-jing  XU Xiao-ming and SU Jian-feng
Affiliation:Intelligent Control Research Institute,Shanghai Jiaotong University,Shanghai 200030;Intelligent Control Research Institute,Shanghai Jiaotong University,Shanghai 200030;Intelligent Control Research Institute,Shanghai Jiaotong University,Shanghai 200030
Abstract:Matching between two images is often needed in automated visual inspection. Template matching, which is the most principle approach for shape match, is time consuming in case of variation in position and rotation. In this paper, an improved algorithm for 2D shape matching based on Hausdorff Distance is proposed. Hausdorff Distance is used to measure the degree of similarity between two objects to make matching more efficiently. A high dimensional, non diferentiable, and multi modal objective function can be derived based on Hausdorff Distance. Although Genetic Algorithm is a powerful and attractive procedure for function optimization, the solution generated by the procedure do not guarantee to be the global optimal. A follow up optimization scheme such as the line search method is applied, which is capable of finding the minimum value of a unimodal function over a finite search interval. Initially the non differentiable function is solved using multi point stochastic search, and the solution is further improved by executing a sequence of successive line searches that approach the optimal to a pre determined precision. The experimental results show that the proposed method is capable of matching 2D shape with higher speed and precision.
Keywords:Shape matching  Genetic algorithm  Line search
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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