首页> 外文会议>International Symposium on Advances in Visual Computing >Iterative Closest SIFT Formulation for Robust Feature Matching
【24h】

Iterative Closest SIFT Formulation for Robust Feature Matching

机译:迭代最接近的SIFT配方,适用于强大的功能匹配

获取原文
获取外文期刊封面目录资料

摘要

This paper presents a new feature matching algorithm. The proposed algorithm integrates the Scale Invariant Feature Transform (SIFT) local descriptor in the Iterative Closest Point (ICP) scheme. The new algorithm addresses the problem of finding the appropriate match between repetitive patterns that appear in manmade scenes. The matching of two sets of points is computed integrating appearance and distance properties between putative match candidates. To demonstrate the performance of the new algorithm, the new approach is applied on real images. The results show that the proposed algorithm increases the number of correct feature correspondences and at the same time reduces significantly matching errors when compared to the original SIFT and ICP algorithms.
机译:本文提出了一种新的特征匹配算法。该算法在迭代最近点(ICP)方案中集成了尺度不变特征变换(SIFT)本地描述符。新算法解决了在Manade场景中出现的重复模式之间找到适当匹配的问题。两组点的匹配是计算在推定匹配候选之间的外观和距离特性的集成。为了展示新算法的性能,新方法应用于真实图像。结果表明,与原始SIFT和ICP算法相比,所提出的算法增加了正确的特征对应关系的数量,同时,同时减少了显着匹配的错误。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号