HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition
Abstract
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.
Cite
@article{arxiv.1802.09261,
title = {HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition},
author = {Dominik Schlegel and Giorgio Grisetti},
journal= {arXiv preprint arXiv:1802.09261},
year = {2018}
}
Comments
Submitted to IEEE Robotics and Automation Letters (RA-L) 2018 with International Conference on Intelligent Robots and Systems (IROS) 2018 option, 8 pages, 10 figures