Publications

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication


Year(s) from:  to 
Author:
Keywords (separated by spaces):

Iterative Nearest Neighbors for Classification and Dimensionality Reduction

Radu Timofte and Luc Van Gool
IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2012)
US, June 2012

Abstract

Representative data in terms of a set of selected samples is of interest for various machine learning applications, e.g. dimensionality reduction and classification. The best-known techniques probably still are k-Nearest Neighbors (kNN) and its variants. Recently, richer representations have become popular. Examples are methods based on l1-regularized least squares (Sparse Representation (SR)) or l2-regularized least squares (Collaborative Representation (CR)), or on l1-constrained least squares (Local Linear Embedding (LLE)). We propose Iterative Nearest Neighbors (INN). This is a novel sparse representation that combines the power of SR and LLE with the computational simplicity of kNN. We test our method in terms of dimensionality reduction and classification, using standard benchmarks such as faces (AR), traffic signs (GTSRB), and PASCAL VOC 2007. INN performs better than NN and comparable with CR and SR, while being orders of magnitude faster than the latter.


Link to publisher's page
Download in pdf format
@InProceedings{eth_biwi_01284,
  author = {Radu Timofte and Luc Van Gool},
  title = {Iterative Nearest Neighbors for Classification and Dimensionality Reduction},
  booktitle = {IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2012)},
  year = {2012},
  month = {June},
  keywords = {}
}