BTEL uses a binary tree structure to encode visual features for localization, delivering sub-linear storage and query time while remaining agnostic to front-end descriptors.
Learning place-dependant features for long-term vision-based localisation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
BTEL: A Binary Tree Encoding Approach for Visual Localization
BTEL uses a binary tree structure to encode visual features for localization, delivering sub-linear storage and query time while remaining agnostic to front-end descriptors.