Parallelized Iterative Closest Point for Autonomous Aerial Refueling

The Iterative Closest Point algorithm is a widely used approach to aligning the geometry between two 3 dimensional objects. The capability of aligning two geometries in real time on low-cost hardware will enable the creation of new applications in Computer Vision and Graphics. The execution time of many modern approaches are dominated by either the k nearest neighbor search (kNN) or the point alignment phase. This work presents an accelerated alignment variant which utilizes parallelization on a Graphics Processing Unit (GPU) of multiple kNN approaches augmented with a novel Delaunay Traversal to achieve real time estimates.

[1]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[2]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4]  Michael A. Greenspan,et al.  Approximate k-d tree search for efficient ICP , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[5]  João Marcelo X. N. Teixeira,et al.  Understanding the Efficiency of kD-tree Ray-Traversal Techniques over a GPGPU Architecture , 2012, International Journal of Parallel Programming.

[6]  Ernst P. Mücke,et al.  Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1996, SCG '96.

[7]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[8]  Michel Barlaud,et al.  Fast k nearest neighbor search using GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[9]  Fabian Gieseke,et al.  Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs , 2014, ICML.

[10]  Radu Bogdan Rusu,et al.  3D is here: Point Cloud Library (PCL) , 2011, 2011 IEEE International Conference on Robotics and Automation.

[11]  Daniel Eggert,et al.  OCTREE-BASED SIMD STRATEGY FOR ICP REGISTRATION AND ALIGNMENT OF 3D POINT CLOUDS , 2012 .

[12]  Seiichiro Kagei,et al.  High-speed point cloud matching algorithm for medical volume images using 3D Voronoi diagram , 2014, 2014 7th International Conference on Biomedical Engineering and Informatics.

[13]  Nina Amenta,et al.  Brute-Force k-Nearest Neighbors Search on the GPU , 2015, SISAP.

[14]  Kyle P Werner,et al.  Precision Relative Positioning for Automated Aerial Refueling from a Stereo Imaging System , 2015 .

[15]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.