Generalized-ICP

In this paper we combine the Iterative Closest Point (’ICP’) and ‘point-to-plane ICP‘ algorithms into a single probabilistic framework. We then use this framework to model locally planar surface structure from both scans instead of just the ”model” scan as is typically done with the point-to-plane method. This can be thought of as ‘plane-to-plane’. The new approach is tested with both simulated and real-world data and is shown to outperform both standard ICP and point-to-plane. Furthermore, the new approach is shown to be more robust to incorrect correspondences, and thus makes it easier to tune the maximum match distance parameter present in most variants of ICP. In addition to the demonstrated performance improvement, the proposed model allows for more expressive probabilistic models to be incorporated into the ICP framework. While maintaining the speed and simplicity of ICP, the Generalized-ICP could also allow for the addition of outlier terms, measurement noise, and other probabilistic techniques to increase robustness.

[1]  Andrea Censi,et al.  Scan matching in a probabilistic framework , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[2]  Florent Lamiraux,et al.  Metric-Based Scan Matching Algorithms for Mobile Robot Displacement Estimation , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[3]  Zhengyou Zhang,et al.  Iterative point matching for registration of free-form curves and surfaces , 1994, International Journal of Computer Vision.

[4]  Luis Montesano,et al.  Probabilistic scan matching for motion estimation in unstructured environments , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Wolfgang Straßer,et al.  A Probabilistic Framework for Robust and Accurate Matching of Point Clouds , 2004, DAGM-Symposium.

[6]  Min-Hyung Choi,et al.  An Improved ICP Algorithm Based on the Sensor Projection for Automatic 3D Registration , 2004, MICAI.

[7]  Marc Levoy,et al.  Geometrically stable sampling for the ICP algorithm , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[8]  Wolfram Burgard,et al.  Learning compact 3D models of indoor and outdoor environments with a mobile robot , 2003, Robotics Auton. Syst..

[9]  Patrick J. Flynn,et al.  Pair-Wise Range Image Registration: A Study in Outlier Classification , 2002, Comput. Vis. Image Underst..

[10]  D. Hähnel,et al.  Probabilistic Matching for 3D Scan Registration , 2002 .

[11]  Andrew W. Fitzgibbon,et al.  Robust Registration of 2D and 3D Point Sets , 2003, BMVC.

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

[13]  J.-S. Gutmann,et al.  AMOS: comparison of scan matching approaches for self-localization in indoor environments , 1996, Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96).

[14]  Evangelos E. Milios,et al.  Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

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

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

[17]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .