バイナリ特徴量の高速照合のためのハミング距離埋め込み二分探索木
HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition
バイナリ特徴記述子の性質を利用し、対数時間で記述子の検索と挿入ができる二分探索木HBSTを提案し、視覚的位置認識のための画像検索で有効性を示した。
著者: Dominik Schlegel, Giorgio Grisetti
分類: cs.RO, cs.CV
原文アブストラクト
Reliable and efficient Visual Place Recognition is a major building block of modern SLAM systems. Leveraging on our prior work, in this paper we present a Hamming Distance embedding Binary Search Tree (HBST) approach for binary Descriptor Matching and Image Retrieval. HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors. We support the idea behind our search structure with a thorough analysis on the exploited descriptor properties and their effects on completeness and complexity of search and insertion. To validate our claims we conducted comparative experiments for HBST and several state-of-the-art methods on a broad range of publicly available datasets. HBST is available as a compact open-source C++ header-only library.
