Fast exact nearest neighbour matching in high dimensions using d-D Sort

Lakemond, Ruan, Fookes, Clinton B., & Sridharan, Sridha (2013) Fast exact nearest neighbour matching in high dimensions using d-D Sort. ISRN Machine Vision, 2013, pp. 1-8.

[img] Accepted Version (PDF 315kB)
Administrators only | Request a copy from author

View at publisher (open access)


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.

Impact and interest:

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 58515
Item Type: Journal Article
Refereed: Yes
Additional Information: Article ID 405680
Additional URLs:
DOI: 10.1155/2013/405680
ISSN: 2090-7796
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright © 2013 Ruan Lakemond et al.
Copyright Statement: Copyright © 2013 Ruan Lakemond et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Deposited On: 20 Mar 2013 23:11
Last Modified: 11 Apr 2013 04:08

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page