In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Abstract. Finding an image’s exact GPS location is a challenging computer vision problem that has many real-world applications. In this paper, we address the problem of finding ...