Locality sensitive hashing: a comparison of hash function types and querying mechanisms - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Letters Year : 2010

Locality sensitive hashing: a comparison of hash function types and querying mechanisms

(1) , (2) , (2)
1
2

Abstract

It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Dramatic performance gains are obtained using approximate search schemes, such as the popular Locality-Sensitive Hashing (LSH). Several extensions have been proposed to address the limitations of this algorithm, in particular, by choosing more appropriate hash functions to better partition the vector space. All the proposed extensions, however, rely on a structured quantizer for hashing, poorly fitting real data sets, limiting its performance in practice. In this paper, we compare several families of space hashing functions in a real setup, namely when searching for high-dimensional SIFT descriptors. The comparison of random projections, lattice quantizers, k-means and hierarchical k-means reveal that unstructured quantizer significantly improves the accuracy of LSH, as it closely fits the data in the feature space. We then compare two querying mechanisms introduced in the literature with the one originally proposed in LSH, and discuss their respective merits and limitations.
Vignette du fichier
different_hash_function.png (65.43 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
paper.pdf (259.83 Ko) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00567191 , version 1 (18-02-2011)

Identifiers

Cite

Loïc Paulevé, Hervé Jégou, Laurent Amsaleg. Locality sensitive hashing: a comparison of hash function types and querying mechanisms. Pattern Recognition Letters, 2010, 31 (11), pp.1348-1358. ⟨10.1016/j.patrec.2010.04.004⟩. ⟨inria-00567191⟩
6187 View
8884 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More