Efficient and Accurate Registration of Point Clouds with Plane to Plane Correspondences

We propose and analyse methods to efficiently register point clouds based on plane correspondences. This is relevant in man-made environments, where most objects are bounded by planar surfaces. Based on a segmentation of the point clouds into planar regions and matches of planes in different point clouds, we (1) optimally estimate the relative pose(s); (2) provide three direct solutions, of which two take the uncertainty of the given planes into account; and (3) analyse the loss in accuracy of the direct solutions as compared to the optimal solution. The paper presents the different solutions, derives their uncertainty especially of the suboptimal direct solutions, and compares their accuracy based on simulated and real data. We show that the direct methods that exploit the uncertainty of the planes lead to a maximum loss of 2.76 in accuracy of the estimated motion parameters in terms of the achieved standard deviations compared to the optimal estimates. We also show that the results are more accurate than the classical iterative closest point and iterative closest plane method, but the estimation procedures have a significantly lower computational complexity. We finally show how to generalize the estimation scheme to simultaneously register multiple point clouds.1

[1]  Helmut Pottmann,et al.  Registration of point cloud data from a geometric optimization perspective , 2004, SGP '04.

[2]  Kourosh Khoshelham,et al.  Automated localization of a laser scanner in indoor environments using planar objects , 2010, 2010 International Conference on Indoor Positioning and Indoor Navigation.

[3]  Gérard G. Medioni,et al.  Object modelling by registration of multiple range images , 1992, Image Vis. Comput..

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

[5]  Claus Brenner,et al.  Coarse orientation of terrestrial laser scans in urban environments , 2008 .

[6]  H. P. Hildre,et al.  Fast plane detection for SLAM from noisy range images in both structured and unstructured environments , 2011, 2011 IEEE International Conference on Mechatronics and Automation.

[7]  Wolfram Burgard,et al.  G2o: A general framework for graph optimization , 2011, 2011 IEEE International Conference on Robotics and Automation.

[8]  Ayman Habib,et al.  SOLUTION FREQUENCY-BASED PROCEDURE FOR AUTOMATED REGISTRATION OF TERRESTRIAL LASER SCANS USING LINEAR FEATURES , 2014 .

[9]  Kourosh Khoshelham,et al.  Closed-form solutions for estimating a rigid motion from plane correspondences extracted from point clouds , 2016 .

[10]  Sven Behnke,et al.  Real-Time Plane Segmentation Using RGB-D Cameras , 2012, RoboCup.

[11]  Ross T. Whitaker,et al.  Indoor scene reconstruction from sets of noisy range images , 1999, Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062).

[12]  Junhao Xiao,et al.  3D point cloud registration based on planar surfaces , 2012, 2012 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI).

[13]  C. Stachniss,et al.  On the Quality and Efficiency of Approximate Solutions to Bundle Adjustment with Epipolar and Trifocal Constraints , 2017 .

[14]  G. Vosselman Point cloud segmentation for urban scene classification , 2013 .

[15]  Vladlen Koltun,et al.  Fast Global Registration , 2016, ECCV.

[16]  Martyna Poreba,et al.  A Robust Linear Feature-Based Procedure for Automated Registration of Point Clouds , 2015, Sensors.

[17]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[18]  Andreas Birk,et al.  Uncertainty analysis for optimum plane extraction from noisy 3D range-sensor point-clouds , 2010, Intell. Serv. Robotics.

[19]  Andreas Birk,et al.  Fast Registration Based on Noisy Planes With Unknown Correspondences for 3-D Mapping , 2010, IEEE Transactions on Robotics.

[20]  Wolfgang Förstner,et al.  Photogrammetric Computer Vision: Statistics, Geometry, Orientation and Reconstruction , 2017 .

[21]  Yuichi Taguchi,et al.  A Theory of Minimal 3D Point to 3D Plane Registration and Its Generalization , 2013, International Journal of Computer Vision.

[22]  Karl-Rudolf Koch,et al.  Parameter estimation and hypothesis testing in linear models , 1988 .

[23]  Lena Maier-Hein,et al.  Convergent Iterative Closest-Point Algorithm to Accomodate Anisotropic and Inhomogenous Localization Error , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Derek D. Lichti,et al.  Inner Constraints for Planar Features , 2013 .

[25]  Gabriel Taubin,et al.  An improved algorithm for algebraic curve and surface fitting , 1993, 1993 (4th) International Conference on Computer Vision.

[26]  Gérard G. Medioni,et al.  Object modeling by registration of multiple range images , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[27]  Russell H. Taylor,et al.  Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment , 2015, PloS one.