• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data

Vol. 7, No.3, March 31, 2013
10.3837/tiis.2013.03.003, Download Paper (Free):

Abstract

The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Shwu-Huey Yen and Ya-ju Hsieh, "A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data," KSII Transactions on Internet and Information Systems, vol. 7, no. 3, pp. 459-470, 2013. DOI: 10.3837/tiis.2013.03.003

[ACM Style]
Yen, S. and Hsieh, Y. 2013. A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data. KSII Transactions on Internet and Information Systems, 7, 3, (2013), 459-470. DOI: 10.3837/tiis.2013.03.003