Fast K Nearest Neighbor Search Using GPU | Awesome Learning to Hash Add your paper to Learning2Hash

Fast K Nearest Neighbor Search Using GPU

Vincent Garcia, Eric Debreuve, Michel Barlaud . 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops 2008 – 440 citations

[Paper]   Search on Google Scholar   Search on Semantic Scholar
CVPR Tools & Libraries

The recent improvements of graphics processing units (GPU) offer to the computer vision community a powerful processing platform. Indeed, a lot of highly-parallelizable computer vision problems can be significantly accelerated using GPU architecture. Among these algorithms, the k nearest neighbor search (KNN) is a well-known problem linked with many applications such as classification, estimation of statistical properties, etc. The main drawback of this task lies in its computation burden, as it grows polynomially with the data size. In this paper, we show that the use of the NVIDIA CUDA API accelerates the search for the KNN up to a factor of 120.

Similar Work