zoukankan      html  css  js  c++  java
  • 泡泡一分钟:LandmarkBoost: Efficient Visual Context Classifiers for Robust Localization

    Marcin Dymczyk, Igor Gilitschenski, Juan Nieto, Simon Lynen, Bernhard Zeis, and Roland Siegwart

    LandmarkBoost: Efficient Visual Context Classifiers for Robust Localization

    LandmarkBoost:用于鲁棒定位的高效的视觉上下文分类器
    Abstract—The growing popularity of autonomous systems creates a need for reliable and efficient metric pose retrieval algorithms. Currently used approaches tend to rely on nearest neighbor search of binary descriptors to perform the 2D3D matching and guarantee realtime capabilities on mobile platforms. These methods struggle, however, with the growing size of the map, changes in viewpoint or appearance, and visual aliasing present in the environment. The rigidly defined descriptor patterns only capture a limited neighborhood of the keypoint and completely ignore the overall visual context.
    We propose LandmarkBoost – an approach that, in contrast to the conventional 2D-3D matching methods, casts the search problem as a landmark classification task. We use a boosted classifier to classify landmark observations and directly obtain correspondences as classifier scores. We also introduce a formulation of visual context that is flexible, efficient to compute, and can capture relationships in the entire image plane. The original binary descriptors are augmented with contextual information and informative features are selected by the boosting framework. Through detailed experiments, we evaluate the retrieval quality and performance of LandmarkBoost, demonstrating that it outperforms common state-of-theart descriptor matching methods.
    自治系统的日益普及产生了对可靠和有效的度量姿势检索算法的需求。当前使用的方法倾向于依赖二进制描述符的最近邻搜索来执行2D3D匹配并保证移动平台上的实时能力。然而,这些方法与地图的大小增加,视点或外观的变化以及环境中存在的视觉混叠相矛盾。
    我们提出LandmarkBoost--与传统的2D-3D匹配方法相比,这种方法将搜索问题作为标志性的分类任务。
    我们使用提升的分类器对具有里程碑意义的观察进行分类,并直接获得对应关系作为分类分数。我们还介绍了一种灵活的视觉上下文,能够有效地计算,并且可以捕捉整个图像平面中的关系。 原始二进制描述符用上下文信息增强,并且增强框架选择信息特征。通过详细的实验,我们评估了LandmarkBoost的检索质量和性能,证明它优于常见的描述符匹配方法。
     
  • 相关阅读:
    【小白建站笔记】从购买域名及服务器到备案成功:以阿里云为例
    jarvisoj-Evil Exe
    jarvisoj-软件密码破解-2(CFF_100_1)
    Jarvis OJ-superexpress
    JarvisOJ-[xman2019]xfz
    csictf-Esrever
    分解质因数
    矩阵乘法
    python获取一组数个位数之和
    python计算字母出现次数
  • 原文地址:https://www.cnblogs.com/feifanrensheng/p/10843449.html
Copyright © 2011-2022 走看看