Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation

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 preserves the local similarity structure. A method to find the approximate nearest neighbor of a query is proposed, that drastically reduces the total number of explicit distance measures that need to be computed. The representation overcomes the restrictive assumptions in traditional manifold mappings, while enabling fast nearest neighbor’s search. Experimental results on the Unipen and CASIA Iris datasets clearly demonstrates the advantages of the approach and improvements over state of the art algorithms. The algorithm can work in batch mode as well as in sequential mode and is highly scalable.

• Type: Conference
• Year: 2009
• Where: ICAPR
• Authors: Pratyush Bhatt, Anoop M. Namboodiri
• Keywords: Fast Nearest Neighbor, ICAPR 2009, Nearest Neighbor, Nearest Neighbors Retrieval, Pattern Recognition