A comparison of nearest neighbor search algorithms for generic object recognition

  • Authors:

  • Ferid Bajramovic;Frank Mattern;Nicholas Butko;Joachim Denzler

  • Affiliations:

  • Chair for Computer Vision, Friedrich-Schiller-University Jena;Chair for Computer Vision, Friedrich-Schiller-University Jena;Department of Cognitive Science, University of California at San Diego;Chair for Computer Vision, Friedrich-Schiller-University Jena

  • Venue:
  • ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in the amount of data. There are several approaches to improve runtime and/or memory requirements of nearest neighbor methods: Thinning methods select and store only part of the training data for the classifier. Efficient query structures reduce query times. In this paper, we present an experimental comparison and analysis of such methods using the ETH-80 database. We evaluate the following algorithms. Thinning: condensed nearest neighbor, reduced nearest neighbor, Baram's algorithm, the Baram-RNN hybrid algorithm, Gabriel and GSASH thinning. Query structures: kd-tree and approximate nearest neighbor. For the first four thinning algorithms, we also present an extension to k-NN which allows tuning the trade-off between data reduction and classifier degradation. The experiments show that most of the above methods are well suited for generic object recognition.