首页> 外文会议>International Conference on Sensors Models in Remote Sensing Photogrammetry >AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING
【24h】

AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

机译:基于RANSAC和基于宽基线图像匹配的不匹配消除方法

获取原文

摘要

In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT) descriptor, which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus) method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM) algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and capability.
机译:在本文中,我们提出了一种综合方法,以提高特征点匹配的精度。许多不同的算法已经开发出优化短基线图像匹配,而由于照明差异和观点变化,宽基线图像匹配是如此难以处理。幸运的是,最近的自动提取局部不变特征的发展使得宽基线图像匹配可能。基于本地特征相似性原理的匹配算法,使用特征描述符来建立特征点集之间的对应关系。迄今为止,最卓越的描述符是尺度不变的特征变换(SIFT)描述符,其不变于图像旋转和比例,并且在大量仿射失真,噪声的存在和照明的变化中保持稳健。基于RANSAC(随机样本共识)方法的末极约束是用于不匹配消除的传统模型,特别是在计算机视觉中。因为只考虑了距骨头线的距离,所以基于末极几何和Ransac所选择的匹配结果中存在一些错误匹配。 Aguilariu等。提出的图形转换匹配(GTM)算法删除异常值,当由同一局部邻居结构包围的不匹配点时,在不匹配的点时存在一些困难。在该研究中,为了克服上述限制,呈现了一种新的三步匹配方案,其中SIFT算法用于获得初始对应点集。在第二步中,为了减少异常值,应用RANSAC算法。最后,为了基于相邻的K-NN图来删除剩余的不匹配,实现了GTM。有四个不同的近距离图像数据集随着视点的变化,用于评估所提出的方法的性能,实验结果表明其鲁棒性和能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号