GPU-Accelerated Nearest Neighbor Search for 3D Registration
University of Applied Sciences Bonn-Rhein-Sieg, Sankt Augustin, Germany
Computer Vision Systems, Lecture Notes in Computer Science, 2009, Volume 5815/2009, 194-203
@article{qiu2009gpu,
title={GPU-accelerated nearest neighbor search for 3D registration},
author={Qiu, D. and May, S. and N{\”u}chter, A.},
journal={Computer Vision Systems},
pages={194–203},
year={2009},
publisher={Springer}
}
Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. The basic problem is in rapidly processing a huge amount of data, which is often addressed by means of highly sophisticated search methods and parallelism. We show that NNS based vision algorithms like the Iterative Closest Points algorithm (ICP) can achieve real-time capability while preserving compact size and moderate energy consumption as it is needed in robotics and many other domains. The approach exploits the concept of general purpose computation on graphics processing units (GPGPU) and is compared to parallel processing on CPU. We apply this approach to the 3D scan registration problem, for which a speed-up factor of 88 compared to a sequential CPU implementation is reported.
November 5, 2010 by hgpu
