2016
Improved Hamming Distance Search Using Variable Length Substrings
CVPR 2016poster
This paper addresses the problem of ultra-large-scale search in Hamming spaces. There has been considerable research on generating compact binary codes in vision, for example for visual search tasks. However the issue of efficient searching through huge sets of binary codes remains largely unsolved.…