Lattice-based Locality Sensitive Hashing is Optimal.

Karthekeyan Chandrasekaran Daniel Dadush Venkata Gandikota Elena Grigorescu

Published in: ITCS (2018)

Keyphrases

locality sensitive hashing
nearest neighbor search
hash functions
nearest neighbor
similarity search
sift features
dynamic programming
brute force
binary codes
space efficient
approximate nearest neighbor
databases
object recognition
hamming distance