作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (12): 193-195. doi: 10.3969/j.issn.1000-3428.2011.12.065

• 图形图像处理 • 上一篇    下一篇

基于Hausdorff距离的图像配准快速算法

杨通钰,彭国华   

  1. (西北工业大学理学院,西安 710129)
  • 收稿日期:2010-12-01 出版日期:2011-06-20 发布日期:2011-06-20
  • 作者简介:杨通钰(1984-),男,硕士研究生,主研方向:图像处理,计算机图形学;彭国华,教授、博士、博士生导师
  • 基金资助:

    国家自然科学基金资助项目(60672135)

Fast Algorithm for Image Registration Based on Hausdorff Distance

YANG Tong-yu, PENG Guo-hua   

  1. (School of Science, Northwestern Polytechnical University, Xi’an 710129, China)
  • Received:2010-12-01 Online:2011-06-20 Published:2011-06-20

摘要:

在图像配准过程中,传统Hausdorff距离算法的计算量较大。针对该问题,提出一种基于Hausdorff距离的图像配准快速算法。将参考图像和待配准图像进行边缘检测,在待配准图像上任意选取一个模板,通过设定一个变化的阈值对Hausdorff距离算法进行改进,以减少不必要点的计算,实现快速匹配,并根据匹配数据,对图像进行尺度变换及旋转操作,使2幅图像能在空间上配准。实验结果表明,与传统的配准算法相比,该算法的计算复杂度较低。

关键词: 模板匹配, 图像配准, 边缘检测, 二值化, Hausdorff距离算法

Abstract:

In the image registration process, the computational complexity is the major problem of the traditional Hausdorff distance algorithm. This paper proposes an image registration fast algorithm based on Hausdorff distance. Edge examination to the reference image and the image is registration, and then chooses a template, sets a variable threshold to improve the Hausdorff distance algorithm so as to reduce the amount of unnecessary to achieve rapid match. According to the matched data, it carries on the scale transformation and the rotation operation to the image, enables two images registration in the space. Experimental result proves that, comparing with the traditional matching algorithm, the computational complexity reduced greatly.

Key words: template matching, image registration, edge detection, binarization, Hausdorff distance algoritm

中图分类号: