Fast k Nearest Neighbor Search using GPU

04/09/2008
by   Vincent Garcia, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

k-NN Graph Construction: a Generic Online Approach

Nearest neighbor search and k-nearest neighbor graph construction are tw...
research
09/13/2018

Computer Vision-aided Atom Tracking in STEM Imaging

To address the SMC'17 data challenge -- "Data mining atomically resolved...
research
12/02/2019

GGNN: Graph-based GPU Nearest Neighbor Search

Approximate nearest neighbor (ANN) search in high dimensions is an integ...
research
06/24/2019

An Empirical Comparison of FAISS and FENSHSES for Nearest Neighbor Search in Hamming Space

In this paper, we compare the performances of FAISS and FENSHSES on near...
research
06/28/2022

TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s

This paper presents a novel nearest neighbor search algorithm achieving ...
research
03/30/2020

Faster than FAST: GPU-Accelerated Frontend for High-Speed VIO

The recent introduction of powerful embedded graphics processing units (...
research
05/11/2020

A Survey on Patch-based Synthesis: GPU Implementation and Optimization

This thesis surveys the research in patch-based synthesis and algorithms...

Please sign up or login with your details

Forgot password? Click here to reset