Search results
Feb 26, 2018 · HBST is a method for fast and reliable descriptor matching and image retrieval based on Hamming distance embedding. It exploits the properties of binary feature descriptors and is available as an open-source library.
- Dominik Schlegel, Giorgio Grisetti
- arXiv:1802.09261 [cs.RO]
- 2018
HBST is a novel method for visual place recognition based on Hamming distance and spatial transform. It is presented in a letter published in IEEE Robotics and Automation Letters in October 2018.
- Dominik Schlegel, Giorgio Grisetti
- 2018
HBST participa do Encontro dos Coordenadores de Enfermagem/Qualidade da São Camilo – Superintendência Sul
HBST. A C++ implementation of Hidden Binary Search Tree described in in this paper by Saulo Queiroz. HBST maintains its height O (B) = O (log2n), where B is a size of each key in bits.
Feb 26, 2018 · HBST is a method for fast and reliable descriptor matching and image retrieval based on Hamming distance embedding. It exploits the properties of binary feature descriptors and is available as an open-source C++ library.
Looking for online definition of HBST or what HBST stands for? HBST is listed in the World's most authoritative dictionary of abbreviations and acronyms.
Feb 26, 2018 · HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors.
