Abstract

Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on the important and technically difficult case where each data element is high dimensional, or more generally, is represented by a point in a large metric spaceand distance calculations are computationally expensive. In this paper we introduce a data structure to solve this problem called a GNAT- Geometric Near-neighbor Access Tree. It is based on the philosophy that the data structure should act as a hierarchical geometrical model of the data as opposed to a simple decomposition of the data that does not use its intrinsic geometry. In experiments, we find that GNAT’s outperform previous data structures in a number of applications.

Citations

405	Comparing images using the Hausdorff distance - Huttenlocher, Klanderman, et al. - 1993
225	Data structures and algorithms for nearest neighbor search in general metric spaces - Yianilos - 1993
130	Approximate string-matching with q-grams and maximal matches, Theoretical Computer Science 92 - Ukkonen - 1992
117	Some approaches to best-match file searching - Burkhard, Keller - 1973
103	A branch and bound algorithm for computing k-nearest neighbors - Fukunaga, Narendra - 1975
49	New techniques for best-match retrieval - Shasha, Wang - 1990
21	Satisfying General Proximity / Similarity Queries with Metric Trees - Uhlmann - 1991
12	The nearest neighbor problem in an abstract metric space - Feustel, Shapiro - 1982
7	A spatial index for approximate multiple string matching - Bugnion, Fhei, et al. - 1993
2	structures and algorithms for nearest neighbor search in general metric spaces - Data - 1993
1	Comparing images using the hausPage dorff distance - Huttenlocher, Rucklidge - 1993