首页> 外文会议>2014 13th International Conference on Control Automation Robotics amp; Vision >Contextual descriptors improving credibility of keypoint matching: Harris-Affine, Hessian-Affme and SIFT feasibility study
【24h】

Contextual descriptors improving credibility of keypoint matching: Harris-Affine, Hessian-Affme and SIFT feasibility study

机译:上下文描述符提高了关键点匹配的可信度:Harris-Affine,Hessian-Affme和SIFT可行性研究

获取原文
获取原文并翻译 | 示例

摘要

The paper proposes CONSIFT descriptors which are the rotation-variant modification of SIFT (primarily for affine-invariant keypoints). CONSIFT of a keypoint K is its SIFT computed relatively to the orientation defined by the location of another keypoint L (and concatenated with similarly computed SIFT for keypoint L relatively to the location of K). It is additionally recommended that K and L are extracted by different detectors of complementary properties (e.g. Harris-Affine and Hessian-Affine). The paper evaluates CONSIFT performances over the benchmark dataset. Surprisingly, performances of CONSIFT are nearly equivalent to SIFT. However, the intersection of SIFT-based and CONSIFT-based matches is a highly discriminative tool which rejects most of correspondences which are incorrect in a wider context. Since the method does not require any consistency verification over groups of preliminary matched keypoints (and its memory usage is acceptable) it can be instrumental in large-scale CBVIR systems.
机译:本文提出了CONSIFT描述符,它是SIFT的旋转变量修改(主要用于仿射不变的关键点)。关键点K的CONSIFT是相对于另一个关键点L的位置所定义的方向计算的SIFT(并与相对于K的位置的关键点L的相似计算的SIFT相连接)。另外建议通过互补性不同的检测器(例如Harris-Affine和Hessian-Affine)提取K和L。本文评估了基准数据集上的CONSIFT性能。令人惊讶的是,CONSIFT的性能几乎等同于SIFT。但是,基于SIFT的匹配和基于CONSIFT的匹配的交集是一个高度区分性的工具,它拒绝在较宽泛的上下文中不正确的大多数对应关系。由于该方法不需要对初步匹配的关键点组进行任何一致性验证(并且其内存使用情况是可以接受的),因此可以在大规模CBVIR系统中发挥作用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号