| 基于归并优化的快速特征点匹配算法 |
| |
| 引用本文： | 韩增锟. 基于归并优化的快速特征点匹配算法[J]. 微计算机应用, 2011, 32(11): 8-13 |
| |
| 作者姓名： | 韩增锟 |
| |
| 作者单位： | 燕山大学教务处 秦皇岛066004 |
| |
| 摘 要： | 在使用点特征进行图像匹配的过程中,初始提取的特征点的数量和质量决定了最终的匹配速度和匹配精度.针对这一特点,本文提出对初始提取的特征点集首先进行动态的分块归并优化,然后使用改进的分层投影匹配算法对图像进行粗匹配,最后通过极线约束得到鲁棒的匹配结果.实验表明,本方法在对纹理丰富、尺寸较大的图像进行匹配时,大大提高了运算的速度,同时又保持了匹配的精度.
|
| 关 键 词： | 归并优化 分层投影匹 配极线约束 角点提取 |
A Fast Method for Feature Point Matching Based on Merging Optimization |
| |
| HAN Zengkun. A Fast Method for Feature Point Matching Based on Merging Optimization[J]. Microcomputer Applications, 2011, 32(11): 8-13 |
| |
| Authors: | HAN Zengkun |
| |
| Affiliation: | HAN Zengkun(Academic Affairs Office,Yanshan University,QinHuangdao 066004,China) |
| |
| Abstract: | During the course of image matching by feature points,the number and the quality of the feature points which we picked up at the beginning work on the matching precision and rapidity.According to this trait,a merging method is proposed which is used to optimize the preliminary feature points,and then it takes advantage of hierarchy projection matching to filter feature points and chooses many possible matching points for one reference feature point.At last,it adopts constraint of epipolar to revise matching... |
| |
| Keywords: | merging method hierarchy projection matching epipolar constraint corner detection |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
