arXiv Analytics

Sign in

arXiv:0804.1448 [cs.CV]AbstractReferencesReviewsResources

Fast k Nearest Neighbor Search using GPU

Vincent Garcia, Eric Debreuve, Michel Barlaud

Published 2008-04-09Version 1

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.

Related articles: Most relevant | Search more
arXiv:2401.07378 [cs.CV] (Published 2024-01-14)
Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Search
Guangyu Meng et al.
arXiv:2112.09568 [cs.CV] (Published 2021-12-17, updated 2022-02-21)
Nearest neighbor search with compact codes: A decoder perspective
arXiv:2306.06928 [cs.CV] (Published 2023-06-12)
Sparse-Inductive Generative Adversarial Hashing for Nearest Neighbor Search