13 April 2018 FPFH-based graph matching for 3D point cloud registration
Author Affiliations +
Proceedings Volume 10696, Tenth International Conference on Machine Vision (ICMV 2017); 106960M (2018) https://doi.org/10.1117/12.2309462
Event: Tenth International Conference on Machine Vision, 2017, Vienna, Austria
Abstract
Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jiapeng Zhao, Jiapeng Zhao, Chen Li, Chen Li, Lihua Tian, Lihua Tian, Jihua Zhu, Jihua Zhu, } "FPFH-based graph matching for 3D point cloud registration", Proc. SPIE 10696, Tenth International Conference on Machine Vision (ICMV 2017), 106960M (13 April 2018); doi: 10.1117/12.2309462; https://doi.org/10.1117/12.2309462
PROCEEDINGS
13 PAGES


SHARE
Back to Top