Locality-preserving hashing in multidimensional spaces

@inproceedings{Indyk1997LocalitypreservingHI,
  title={Locality-preserving hashing in multidimensional spaces},
  author={P. Indyk and R. Motwani and P. Raghavan and S. Vempala},
  booktitle={STOC '97},
  year={1997}
}
We consider localitg-preserving hashing — in which adjacent points in the domain are mapped to adjacent or nearlyadjacent points in the range — when the domain is a ddimensional cube. This problem has applications to highdimensional search and multimedia indexing. We show that simple and natural classes of hash functions are provably good for this problem. We complement this with lower bounds suggesting that our results are essentially the best possible. 
154 Citations
Locality preserving hashing for fast image search: theory and applications
Fast locality-sensitive hashing
  • 94
  • PDF
Entropy based nearest neighbor search in high dimensions
  • 229
  • PDF
On Multi-dimensional Hilbert Indexings
  • 31
  • PDF
Efficient search for approximate nearest neighbor in high dimensional spaces
  • 288
  • PDF
Study of the similarity function in Indexing-First-One hashing
Two-way chaining for non-uniform distributions
Simulating Uniform Hashing in Constant Time and Optimal Space
  • 14
...
1
2
3
4
5
...

References

Point location in arrangements of hyper- planes," Information and Computation
  • 1993