Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets

  • There are many nearest neighbor algorithms tailor made for ICP,but most of them require Special input data like range Images or triangle meshes. We focus on efficient nearest neighbor algorithms that do not impose this limitation, and thus can also be used with 3-D point sets generated by structure-frommotion techniques. We shortly present the evaluated algorithms and introduce the modifications we made to improve their efficiency. In particular, several enhancements to the well-known k-D tree algorithm are described. The first part of our Performance Analysis consists of Experiments on synthetic point sets, whereas the second part features experiments with the ICP algorithm on real point sets. Both parts are completed by a thorough evaluation of the obtained results.

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:T. Zinßer, Jochen SchmidtORCiD, H. Niemann
Parent Title (English):Vision, Modeling, and Visualization 2003
Document Type:Conference Proceeding
Language:English
Publication Year:2003
Year of first Publication:2003
Tag:3D Point-Sets; ICP Algorithm
faculties / departments:Fakultät für Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke