Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Anderson, James D.; Raettig, Ryan M.; Larson, Josh; Nykl, Scott L.; Taylor, Clark N.; Wischgoll, Thomas

doi:10.1007/s00138-022-01279-w

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Journal Article · Mon Feb 14 23:00:00 EST 2022 · Machine Vision and Applications

DOI:https://doi.org/10.1007/s00138-022-01279-w· OSTI ID:1981469

^[1]; Raettig, Ryan M. ^[2]; Larson, Josh ^[2]; Nykl, Scott L. ^[2]; Taylor, Clark N. ^[2]; Wischgoll, Thomas ^[1]

Wright State University, Dayton, OH (United States)
Air Force Institute of Technology, Wright-Patterson AFB, OH (United States)

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

View Accepted Manuscript (DOE)

Research Organization:: Oak Ridge Institute for Science and Education (ORISE), Oak Ridge, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC)

Grant/Contract Number:: SC0014664

OSTI ID:: 1981469

Journal Information:: Machine Vision and Applications, Journal Name: Machine Vision and Applications Journal Issue: 2 Vol. 33; ISSN 0932-8092

Publisher:: SpringerCopyright Statement

Country of Publication:: United States

Language:: English

References (21)

Two algorithms for constructing a Delaunay triangulation Lee, D. T.; Schachter, B. J. International Journal of Computer & Information Sciences, Vol. 9, Issue 3 https://doi.org/10.1007/BF00977785	journal	June 1980
Surface Reconstruction by Voronoi Filtering Amenta, N.; Bern, M. Discrete & Computational Geometry, Vol. 22, Issue 4 https://doi.org/10.1007/PL00009475	journal	December 1999
Almost constant-time 3D nearest-neighbor lookup using implicit octrees Drost, Bertram H.; Ilic, Slobodan Machine Vision and Applications, Vol. 29, Issue 2 https://doi.org/10.1007/s00138-017-0889-4	journal	December 2017
Application of Delaunay triangulation to the nearest neighbour method of strain analysis Mulchrone, Kieran F. Journal of Structural Geology, Vol. 25, Issue 5 https://doi.org/10.1016/S0191-8141(02)00067-6	journal	May 2003
Parallel Delaunay triangulation in three dimensions Lo, S. H. Computer Methods in Applied Mechanics and Engineering, Vol. 237-240 https://doi.org/10.1016/j.cma.2012.05.009	journal	September 2012
Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms Stepanov, Alexander; Smith, James MacGregor European Journal of Operational Research, Vol. 218, Issue 3 https://doi.org/10.1016/j.ejor.2011.11.031	journal	May 2012
A method for registration of 3-D shapes Besl, P. J.; McKay, Neil D. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14, Issue 2 https://doi.org/10.1109/34.121791	journal	February 1992
Cached k-d tree search for ICP algorithms Nuchter, Andreas; Lingemann, Kai; Hertzberg, Joachim Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007) https://doi.org/10.1109/3DIM.2007.15	conference	August 2007
Constraint-based planning and control for safe, semi-autonomous operation of vehicles Anderson, Sterling J.; Karumanchi, Sisir B.; Iagnemma, Karl 2012 IEEE Intelligent Vehicles Symposium (IV) https://doi.org/10.1109/IVS.2012.6232153	conference	June 2012
Nearest neighbor pattern classification Cover, T.; Hart, P. IEEE Transactions on Information Theory, Vol. 13, Issue 1, p. 21-27 https://doi.org/10.1109/TIT.1967.1053964	journal	January 1967
Point Set Registration: Coherent Point Drift Myronenko, Andriy IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, Issue 12 https://doi.org/10.1109/TPAMI.2010.46	journal	December 2010
Scalable Nearest Neighbor Algorithms for High Dimensional Data Muja, Marius; Lowe, David G. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 36, Issue 11 https://doi.org/10.1109/TPAMI.2014.2321376	journal	November 2014
Robust and Efficient Surface Reconstruction From Range Data Labatut, P.; Pons, J. -P.; Keriven, R. Computer Graphics Forum, Vol. 28, Issue 8 https://doi.org/10.1111/j.1467-8659.2009.01530.x	journal	December 2009
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation Pan, Jia; Manocha, Dinesh Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems https://doi.org/10.1145/2093973.2094002	conference	November 2011
The quickhull algorithm for convex hulls Barber, C. Bradford; Dobkin, David P.; Huhdanpaa, Hannu ACM Transactions on Mathematical Software, Vol. 22, Issue 4 https://doi.org/10.1145/235815.235821	journal	December 1996
An Algorithm for Finding Best Matches in Logarithmic Expected Time Friedman, Jerome H.; Bentley, Jon Louis; Finkel, Raphael Ari ACM Transactions on Mathematical Software, Vol. 3, Issue 3 https://doi.org/10.1145/355744.355745	journal	September 1977
Multidimensional binary search trees used for associative searching Bentley, Jon Louis Communications of the ACM, Vol. 18, Issue 9 https://doi.org/10.1145/361002.361007	journal	September 1975
R-trees: a dynamic index structure for spatial searching Guttman, Antonin ACM SIGMOD Record, Vol. 14, Issue 2 https://doi.org/10.1145/971697.602266	journal	June 1984
Generalized-ICP Segal, A.; Haehnel, D.; Thrun, S. Robotics: Science and Systems V https://doi.org/10.15607/RSS.2009.V.021	conference	June 2009
A Review of Point Cloud Registration Algorithms for Mobile Robotics Pomerleau, François; Colas, Francis; Siegwart, Roland Foundations and Trends in Robotics, Vol. 4, Issue 1 https://doi.org/10.1561/2300000035	journal	January 2015
A Review of Point Set Registration: From Pairwise Registration to Groupwise Registration Zhu, Hao; Guo, Bin; Zou, Ke Sensors, Vol. 19, Issue 5 https://doi.org/10.3390/s19051191	journal	March 2019

Similar Records

ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain

Journal Article · Fri Oct 01 00:00:00 EDT 2021 · Proceedings of the VLDB Endowment · OSTI ID:1980994

A mesh generator for tetrahedral elements using Delaunay triangulation

Journal Article · Sun Feb 28 23:00:00 EST 1993 · IEEE Transactions on Magnetics (Institute of Electrical and Electronics Engineers); (United States) · OSTI ID:6481880

Extending particle tracking capability with Delaunay triangulation

Journal Article · Wed Apr 16 00:00:00 EDT 2014 · Langmuir · OSTI ID:1252186

Related Subjects

3d point cloud processing
42 ENGINEERING
97 MATHEMATICS AND COMPUTING
Delaunay triangulation
Iterative Closest Point
nearest neighbor search
point registration

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Citation Formats

References (21)

Similar Records

Related Subjects