RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search
Authors:
- Vani NagarajanVNVani Nagarajan
- Durga MandarapuDMDurga Mandarapu
- Milind KulkarniMKMilind Kulkarni
Preprint
Abstract
The problem of identifying the k-Nearest Neighbors (kNNS) of a point has proven to be very useful both as a standalone application and as a subroutine in larger applications. Given its far-reaching applicability in areas such as machine learning and point clouds, extensive research has gone into leveraging GPU acceleration to solve this problem. Recent work has shown that using Ray Tracing cores in recent GPUs to accelerate kNNS is much more efficient compared to traditional acceleration using shader cores. However, the existing translation of kNNS to a ray tracing problem imposes a constraint on the search space for neighbors. Due to this, we can only use RT cores to accelerate fixed-radius kNNS, which requires the user to set a search radius a priori and hence can miss neighbors. In this work, we propose TrueKNN, the first unbounded RT-accelerated neighbor search. TrueKNN adopts an iterative approach where we incrementally grow the search space until all points have found their k neighbors. We show that our approach is orders of magnitude faster than existing approaches and can even be used to accelerate fixed-radius neighbor searches.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Medical Health Big Data Classification Based on KNN Classification AlgorithmIEEE Access, 2019
- Billion-Scale Similarity Search with GPUsIEEE Transactions on Big Data, 2019
- Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU2016
- GPS Data Processing for Scientific Studies of the Earth’s Atmosphere and Near-Space Environment2016
- Core Technologies: Data Mining and “Big Data”2016
- Automated web usage data mining and recommendation system using K-Nearest Neighbor (KNN) classification methodApplied Computing and Informatics, 2016
- Building Accurate 3D Spatial Networks to Enable Next Generation Intelligent Transportation Systems2013
- Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions2006
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967
- Analysis of a complex of statistical variables into principal components.Journal of Educational Psychology, 1933