Locality-preserving hashing in multidimensional spaces

@inproceedings{Indyk1997LocalitypreservingHI,
  title={Locality-preserving hashing in multidimensional spaces},
  author={Piotr Indyk and Rajeev Motwani and Prabhakar Raghavan and Santosh S. Vempala},
  booktitle={Symposium on the Theory of Computing},
  year={1997},
  url={https://api.semanticscholar.org/CorpusID:15693787}
}
It is shown that simple and natural classes of hash functions are provably good for localitg-preserving hashing when the domain is a ddimensional cube, and lower bounds suggest that the results are essentially the best possible.
View on ACM
arl.wustl.edu
193 Citations
Highly Influential Citations
9
Background Citations
74
Methods Citations
47

Figures from this paper

193 Citations

Locality preserving hashing for fast image search: theory and applications

A new hashing method is proposed called the locality-preserving hashing, which builds the hash codes and tables with much lower algorithmic complexity and is very competitive in terms of the training time spent for large data-sets among the state of the arts, and with reasonable or even better query accuracy.

Fast locality-sensitive hashing

A new and simple method to speed up the widely-used Euclidean realization of LSH by the use of randomized Hadamard transforms in a non-linear setting and shows that using the new LSH in nearest-neighbor applications can improve their running times by significant amounts.

On the Distortion of Locality Sensitive Hashing

Given a notion of pairwise similarity between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects h...

BiasHash: A Bayesian Hashing Framework for Image Retrieval

The proposed Bayesian ridge-based Semantic Preserving Hashing (BiasHash) approach is shown to outperform seven state-of-the-art methods on three benchmark datasets.

Entropy based nearest neighbor search in high dimensions

The problem of finding the approximate nearest neighbor of a query point in the high dimensional space is studied, focusing on the Euclidean space, and it is shown that the <i>c</i> nearest neighbor can be computed in time and near linear space where <i*p</i><sup> ≈ 2.06/<i*c—i> becomes large.

Locality-Preserving Hashing for Shifts with Connections to Cryptography

This work applies multidimensional LPHS to obtain an efficient “packed” implementation of homomorphic secret sharing and a sublinear-time implementation of location-sensitive encryption whose decryption requires a significantly overlapping view.

Euclidean lattices for high dimensional indexing and searching

The goal of this internship is to study the use of euclidean lattices for database indexing to be able to rapidly find a small space region containing data similar to a given query point, without reading all the database.

On Multi-dimensional Hilbert Indexings

Hilbert indexings can be completely described and analyzed by "generating elements of order 1", thus, in comparison with previous work, reducing their structural complexity decisively.

Efficient search for approximate nearest neighbor in high dimensional spaces

Significantly improving and extending recent results of Kleinberg, data structures whose size is polynomial in the size of the database and search algorithms that run in time nearly linear or nearly quadratic in the dimension are constructed.

Mixup Augmentation for Deep Hashing

Inspired by the success of mixup-based data augmentation in adversarial training, this technique is applied for the first time to deep hash codes-based image retrieval, and its performance on six kinds of typical deep hashing methods is evaluated.
...

39 References

Non-Expansive Hashing

A non-expansive hashing scheme wherein any set of size from a large universe may be stored in a memory of size (any, and ), and where retrieval takes operations.

Two algorithms for nearest-neighbor search in high dimensions

A new approach to the nearest-neighbor problem is developed, based on a method for combining randomly chosen one-dimensional projections of the underlying point set, which results in an algorithm for finding e-approximate nearest neighbors with a query time of O((d log d)(d + log n)).

Randomized multidimensional search trees: further results in dynamic sampling

    K. Mulmuley
    Computer Science, Mathematics
    [1991] Proceedings 32nd Annual Symposium of…
  • 1991
The use of randomization in dynamic search structures by means of a technique called dynamic sampling is investigated and an efficient algorithm for dynamic point location in 3-D partitions induced by a set of possibly interesting polygons in R/sup 3/ is given.

Point Location in Arrangements of Hyperplanes

We present a solution to the point location problem in arrangements of hyperplanes in Ed with running time O(d5 log n) and space O(nd+?) for arbitrary ? > 0, where n is the number of hyperplanes. The…

Reporting Points in Halfspaces

An optimal algorithm for approximate nearest neighbor searching

It is shown how to preprocess a set of n points in Rd in O( nlog n) time and O(n) space, so that given a query point p E Rd, and e > 0, a (1 + c)-approximate nearest neighbor of q can be computed in O("log n") time.

Efficient and Effective Querying by Image Content

A new theorem is introduced that makes indexing possible by bounding the non-Euclidean, full cross-term quadratic distance expression with a simple Euclidean distance, and it is illustrated how orthogonal transforms, such as the Karhunen Loeve transform, can help reduce the dimensionality, without introducing false dismissals.

Multidimensional Searching Problems

Classic binary search is extended to multidimensional search problems. This extension yields efficient algorithms for a number of tasks such as a secondary searching problem of Knuth, region location…

Discriminant Adaptive Nearest Neighbor Classification

A locally adaptive form of nearest neighbor classification is proposed to try to finesse this curse of dimensionality, and a method for global dimension reduction is proposed, that combines local dimension information.

Image Databases and Multi-Media Search

This book provides a state-of-the-art description of the field of computational methods of searching for pictures, the powerful pictorial clues in the recognition of objects, storage and indexing of objects in a database, and, ways to access the requested pictorial information.