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.net)をご登録いただきますよう、お願いいたします。
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.
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.
HBST participa do Encontro dos Coordenadores de Enfermagem/Qualidade da São Camilo – Superintendência Sul
Feb 26, 2018 · HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors.