Fast Exact Nearest Neighbour Matching in High Dimensions Using d-D Sort. (17th February 2013)

• Record Type: Journal Article
• Authors: Lakemond, Ruan; Fookes, Clinton; Sridharan, Sridha
• Other Names: Ghita O. Academic Editor.; Mattoccia S. Academic Editor.
• Is Part Of: ISRN machine vision. Volume 2013(2013)
• Publication Date: 2013-02-17
• Subjects: Computer vision -- Periodicals; Computer vision; Periodicals; Electronic journals; 006.37
• DOI: 10.1155/2013/405680
• Languages: English
• ISSNs: 2090-7796

Abstract

Abstract : Data structures such as k -D trees and hierarchical k -means trees perform very well in approximate k nearest neighbour matching, but are only marginally more effective than linear search when performing exact matching in high-dimensional image descriptor data. This paper presents several improvements to linear search that allows it to outperform existing methods and recommends two approaches to exact matching. The first method reduces the number of operations by evaluating the distance measure in order of significance of the query dimensions and terminating when the partial distance exceeds the search threshold. This method does not require preprocessing and significantly outperforms existing methods. The second method improves query speed further by presorting the data using a data structure called d -D sort. The order information is used as a priority queue to reduce the time taken to find the exact match and to restrict the range of data searched. Construction of the d -D sort structure is very simple to implement, does not require any parameter tuning, and requires significantly less time than the best-performing tree structure, and data can be added to the structure relatively efficiently.