CoChat

K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching

Garcia, Vincent, Debreuve, Eric, Nielsen, Frank, Barlaud, Michel · 2010 · 2010 IEEE International Conference on Image Processing
Cited by 164

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

The k-nearest neighbor (kNN) search problem is widely used in domains and applications such as classification, statistics, and biology. In this paper, we propose two fast GPU-based implementations of the brute-force kNN search algorithm using the CUDA and CUBLAS APIs. We show that our CUDA and CUBLAS implementations are up to, respectively, 64X and 189X faster on synthetic data than the highly optimized ANN C++ library, and up to, respectively, 25X and 62X faster on high-dimensional SIFT matching.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icip.2010.5654017

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 164

Metadata

Authors
Garcia, V., Debreuve, E., Nielsen, F., & Barlaud, M.
Venue
2010 IEEE International Conference on Image Processing
Publisher
IEEE
Published
2010-09
Pages
3757-3760
ISSN
1522-4880 (ISSN-L)
OpenAlex
W2028960610
Cited by
164
References
3
FWCI
4.95
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching. https://app.cochat.ai/papers/10.1109/icip.2010.5654017
The paper
Garcia, V., Debreuve, E., Nielsen, F., & Barlaud, M. (2010). K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching. 2010 IEEE International Conference on Image Processing. https://doi.org/10.1109/icip.2010.5654017

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.