A modified iterative closest point algorithm for shape registration

The iterative closest point (ICP) algorithm is one of the most popular approaches to shape registration. The algorithm starts with two point clouds and an initial guess for a relative rigid-body transformation between them. Then it iteratively refines the transformation by generating pairs of corresponding points in the clouds and by minimizing a chosen error metric. In this work, we focus on accuracy of the ICP algorithm. An important stage of the ICP algorithm is the searching of nearest neighbors. We propose to utilize for this purpose geometrically similar groups of points. Groups of points of the first cloud, that have no similar groups in the second cloud, are not considered in further error minimization. To minimize errors, the class of affine transformations is used. The transformations are not rigid in contrast to the classical approach. This approach allows us to get a precise solution for transformations such as rotation, translation vector and scaling. With the help of computer simulation, the proposed method is compared with common nearest neighbor search algorithms for shape registration.

[1]  Linda G. Shapiro,et al.  Surface Reconstruction and Display from Range and Color Data , 2000, Graph. Model..

[2]  Nanning Zheng,et al.  Affine Registration of Point Sets Using ICP and ICA , 2008, IEEE Signal Processing Letters.

[3]  Vitaly Kober,et al.  A fusion algorithm for building three-dimensional maps , 2015, SPIE Optical Engineering + Applications.

[4]  Yi Ping Hung,et al.  A fast automatic method for registration of partially-overlapping range images , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[5]  Adrian Hilton,et al.  Registration of multiple point sets , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[6]  Sami Romdhani,et al.  Optimal Step Nonrigid ICP Algorithms for Surface Registration , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[7]  Nanning Zheng,et al.  AN Extension of the ICP Algorithm Considering Scale Factor , 2007, 2007 IEEE International Conference on Image Processing.

[8]  Baba C. Vemuri,et al.  A robust algorithm for point set registration using mixture of Gaussians , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[9]  M. Hebert,et al.  The Representation, Recognition, and Locating of 3-D Objects , 1986 .

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

[11]  Andrew E. Johnson,et al.  Surface registration by matching oriented points , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

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

[13]  Robert Bergevin,et al.  Towards a General Multi-View Registration Technique , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  J. Petitot.  The neurogeometry of pinwheels as a sub-Riemannian contact structure , 2003, Journal of Physiology-Paris.

[15]  Chitra Dorai,et al.  Optimal Registration of Object Views Using Range Data , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Gérard G. Medioni,et al.  Structural Indexing: Efficient 3-D Object Recognition , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Yi-Ping Hung,et al.  RANSAC-Based DARCES: A New Approach to Fast Automatic Registration of Partially Overlapping Range Images , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Kari Pulli,et al.  Multiview registration for large data sets , 1999, Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062).