Bing Liu
ABSTRACT
In order to realize the fast and accurate registration of 3D point cloud data, a new fast weighted registration method is proposed in this paper. Firstly, using curvature feature, the method samples the original 3D point cloud data to quickly find matching points and remove wrong point pairs. Secondly, by introducing the iterative re-weighted least squares (IRLS) algorithm, the method carries out coarse alignment of the scattered point cloud. Finally, the method presents an improved distance-weighted Iterative Closest Point (ICP) algorithm to achieve fine matching. The experimental results show that the method has good convergence, robustness and accuracy.
- Besl, P.J.; Mckay, N.D. A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 1992, 14, 239--256. Google Scholar
Digital Library
- Ying He. An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features. Sensors 2017, 17.Google Scholar
- Martin A. Fischler and Robert C. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Graphics and Image Processing. 1981.Google Scholar
- Wu, Y.; Wang, W.; Lu, K.; Wei, Y.; Chen, Z. A new method for registration of 3D point sets with low overlapping ratios. Procedia CIRP 2015, 27, 202--206.Google ScholarCross Ref
- Zhou, W.; Chen, G.; Du, S.; Li, F. An improved iterative closest point algorithm using clustering. Laser Optoelectron. Prog. 2016, 53, 1--7.Google Scholar
- Du, S.; Dong, J.; Xu, G.; Bi, B.; Cai, Z. An improvement of affine iterative closest point algorithm for partial registration. In Proceedings of the International Conference on Internet Multimedia Computing and Service, Xi'an, China, 19-21 August 2016; pp. 72--75. Google ScholarDigital Library
- Andrew W. Fitzgibbon. Robust registration of 2d and 3d point sets. Image and Vision Computing, 21(13-14):1145--1153, 2003.Google ScholarCross Ref
- Per Bergström · Ove Edlund. Robust registration of point sets using iteratively reweighted least squares. Comput Optim Appl (2014) 58:543--561. Google ScholarDigital Library
- Per Bergström · Ove Edlund. Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach. Numer Algor (2017) 74:755--779. Google ScholarDigital Library
- D. Chetverikov, D. Svirko, and D. Stepanov. The Trimmed Iterative Closest Point Algorithm. Proc. ICPR'02, Qúebec City, 2002. Google ScholarDigital Library
- G. Godin, M. Rioux, and R. Baribeau. Three-dimensional registration using range and intensity information. Proceedings of the SPIE - The International Society for Optical Engineering, 2350:279--290, 1994.Google Scholar
Index Terms
- A Fast Weighted Registration Method of 3D Point Cloud Based on Curvature Feature
Recommendations
An innovative segmentation method with multi-feature fusion for 3D point cloud
Special Section: Fuzzy Logic for Analysis of Clinical Diagnosis and Decision-Making in Health CareIt is the key step of the classification and recognition to segment 3D point cloud. Aiming at the shortcomings of super-voxels concavo-convex segmentation algorithm for 3D point cloud, an efficient segmentation method based on multi-feature fusion is ...
An automatic 3D point cloud registration method based on regional curvature maps
3D point cloud registration is a fundamental and critical issue in 3D reconstruction and object recognition. Most of the existing methods are based on local shape descriptor. In this paper, we propose a discriminative and robust local shape descriptor-...
FFA-Net: fast feature aggregation network for 3D point cloud segmentation
AbstractIn many practical applications like autonomous driving and robot navigation, the large-scale 3D point cloud segmentation method is required to be both fast and efficient. In this paper, a fast and efficient large-scale point cloud semantic ...
Comments