计算机工程2011，Vol.37Issue(12)：193-195,198,4.DOI:10.3969/j.issn.1000-3428.2011.12.065
基于Hausdorff距离的图像配准快速算法
Fast Algorithm for Image Registration Based on Hausdorff Distance
摘要
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.关键词
模板匹配/图像配准/边缘检测/二值化/Hausdorff距离算法Key words
template matching/ image registration/ edge detection/ binarization/ Hausdorff distance algoritm分类
信息技术与安全科学引用本文复制引用
杨通钰,彭国华..基于Hausdorff距离的图像配准快速算法[J].计算机工程,2011,37(12):193-195,198,4.基金项目
国家自然科学基金资助项目(60672135) （60672135）
