Building Correspondence Based on Matching Triangles for Partial Registration

As an important problem in point set registration, partial registration has been solved by some variants of Iterative Closest Point (ICP) algorithm under good initial values. However, the initial parameters remained to be solved for partial registration. This paper presents a parameter initialization algorithm based on matching triangles for partial registration. Experimental results demonstrate that the proposed initialization method can find an appropriate initial transformation for next accurate registration, even the initial rotation angle between two sets is large. Based on the initialization of two point sets, the partial registration can be accomplished by auto trimmed ICP (ATICP) algorithm.

[1]  Rae-Hong Park,et al.  An Orientation Reliability Matrix for the Iterative Closest Point Algorithm , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Andrew W. Fitzgibbon.  Robust registration of 2D and 3D point sets , 2003, Image Vis. Comput..

[3]  Tzung-Han Lin,et al.  An algorithm to build convex hulls for 3‐D objects , 2006 .

[4]  K. S. Arun,et al.  Least-Squares Fitting of Two 3-D Point Sets , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

[6]  Ran Liu,et al.  Outlier Robust ICP for Minimizing Fractional RMSD , 2006, Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007).

[7]  Jianru Xue,et al.  New iterative closest point algorithm for isotropic scaling registration of point sets with noise , 2016, J. Vis. Commun. Image Represent..

[8]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

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

[10]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[11]  Xavier Pennec,et al.  Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration , 2002, ECCV.

[12]  Pavel Krsek,et al.  Robust Euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm , 2005, Image Vis. Comput..

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

[14]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[15]  Nanning Zheng,et al.  Robust iterative closest point algorithm for registration of point sets with outliers , 2011 .

[16]  Wolfram Burgard,et al.  A benchmark for the evaluation of RGB-D SLAM systems , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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