节点文献

一种复杂背景下图像匹配的快速算法

A Fast Algorithm for Image Matching with Complex Background

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 马强高岚胡有为李小泉

【Author】 Ma Qiang, Gao Lan, Hu Youwei, Li Xiaoquan(Energy and Power Engineering College of Wuhan University of Technology, Wuhan 430063)

【机构】 武汉理工大学能源与动力工程学院

【摘要】 图像匹配的关键是时效性和准确性,同时也是判定算法优秀与否的重要标准。传统的基于灰度值的点与点之间做相关运算的算法虽然直接,精确度也较高,但是由于其搜索过程要遍历整幅图片,特别当图片为数据巨大的航空图片时,其花费的时间是巨大的,这不符合时效性的要求。Hausdorff距离是测量两个点集之间匹配程度的一种度量,在计算时不需要建立两个点集中点与点之间的对应关系,只需求得两幅图中相接近点的个数。采用部分Hausdorff距离定义,对目标有噪声影响的情况有较好的处理效果。采用Canny算子对图片提取边缘,得到图像中目标的边缘信息。仅利用边缘信息分析计算,而避免采用整幅图片的数据,大大缩短了计算时间。通过对多幅光学图片进行的检测,表明基于Hausdorff距离的综合匹配方法是有效的。

【Abstract】 The key points of target recognition are efficiency and accuracy, and also standards of judging whether a process is good or bad. Traditional algorithm is simple, which is based on relativity between point and point, and has high accuracy. This method needs to go through the whole picture, especially using picture that taken on plain, so the time spending on searching is too long and not fit for efficiency. Hausdorff distend is a method which is used for measuring the similarity of tow point sets. When we use it for calculating, we need not to establish the correspondence between the tow point sets, and only to calculate the close points. We can get a better result using the method of partial Hausdorff distance when the targets were affected by noise. We can get the edge information of the picture using Canny operator. Using this information for calculating and analyzing, which avoid adapting the whole data of the picture, we can save much time. Detected with some optical pictures, it shows that the synthetical matching process based on Hausdorff distance is effective.

  • 【会议录名称】 可持续发展的中国交通——2005全国博士生学术论坛(交通运输工程学科)论文集(下册)
  • 【会议名称】2005全国博士生学术论坛(交通运输工程学科)
  • 【会议时间】2005-07
  • 【会议地点】中国北京
  • 【分类号】TP391.41
  • 【主办单位】国务院学位委员会、教育部学位管理与研究生教育司
节点文献中: 

本文链接的文献网络图示:

本文的引文网络