Details

Autor(en) / Beteiligte

• Muja, Marius
• Lowe, David G.

Titel

Scalable Nearest Neighbor Algorithms for High Dimensional Data

Ist Teil von

• IEEE transactions on pattern analysis and machine intelligence, 2014-11, Vol.36 (11), p.2227-2240

Ort / Verlag

United States: IEEE

Erscheinungsjahr

2014

Link zum Volltext

Quelle

IEEE Xplore

Beschreibungen/Notizen

• For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbor matches to high dimensional vectors that represent the training data. We propose new algorithms for approximate nearest neighbor matching and evaluate and compare them with previous algorithms. For matching high dimensional features, we find two algorithms to be the most efficient: the randomized k-d forest and a new algorithm proposed in this paper, the priority search k-means tree. We also propose a new algorithm for matching binary features by searching multiple hierarchical clustering trees and show it outperforms methods typically used in the literature. We show that the optimal nearest neighbor algorithm and its parameters depend on the data set characteristics and describe an automated configuration procedure for finding the best algorithm to search a particular data set. In order to scale to very large data sets that would otherwise not fit in the memory of a single machine, we propose a distributed nearest neighbor matching framework that can be used with any of the algorithms described in the paper. All this research has been released as an open source library called fast library for approximate nearest neighbors (FLANN), which has been incorporated into OpenCV and is now one of the most popular libraries for nearest neighbor matching.