AUTOMATIC MORPHOLOGICAL PRE-ALIGNMENT AND GLOBAL HYBRID REGISTRATION OF CLOSE RANGE IMAGES

The point cloud alignment problem has always attracted the interest of the researchers. Two are the procedures usually applied for the close range surveys: the ICP method with all its variants, and the method based on the use of tie points identified by reflecting targets properly located on the overlapping part of two range images. The two methods are not concurrent. ICP requires an initial sufficiently accurate pre-alignment and does not work with regular surfaces; the tie points method requires the materialization and the recognition of the corresponding points, task that it is not always feasible and realizable in economical terms. This paper proposes a new hybrid technique to automatically execute the alignment of close range point clouds by evidencing the corresponding morphological singularities in the various scanning models. The point recognition is based first on the study of the local surface Gaussian curvature values, second by running a clustering procedure of laser points having extreme curvature values, and third by determining the centroids of each cluster. The computation of the local Gaussian curvature is carried out by applying to each sampled point a Taylor’s expansion local nonparametric algorithm with respect to its surrounding points. This makes it possible to locally estimate the surface function value, and its first and second order partial derivatives. The computation of the Weingarten map matrix elements, from second order Taylor’s expansion differential terms, allows to easily determine the Gaussian curvature for each point. For each point cloud, the above defined centroids, generate a vertex configuration. The punctual correspondence with the analogous vertices of an adjacent point cloud are automatically defined, according to the analysis of the respective adjacency matrices. From these sets of pairs, the pre-alignment rototranslation parameters are computed by a SVD algorithm. The final alignment is completed with an ICP method. The experimental results obtained for the alignment of the various parts of one of the well known Stanford models are shown. The paper also reports a general model, derived from the Generalized Procrustes Analysis, to obtain the simultaneous global registration of a set of point clouds. The method is able to simultaneously consider pairs of correspondent points automatically obtained by the ICP algorithm, pairs of tie points manually defined, and control points.

[1]  A. Gruen,et al.  Least squares 3D surface and curve matching , 2005 .

[2]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[3]  Marc Rioux,et al.  Three-dimensional registration using range and intensity information , 1994, Other Conferences.

[4]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[5]  A. Ardeshir Goshtasby Three-dimensional model construction from multiview range images: survey with new results , 1998, Pattern Recognit..

[6]  R. Langevin Differential Geometry of Curves and Surfaces , 2001 .

[7]  P. Schönemann,et al.  Fitting one matrix to another under choice of a central dilation and a rigid motion , 1970 .

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

[9]  F. Crosilla,et al.  AUTOMATIC POINT MATCHING OF GIS GEOMETRIC FIGURES , 2004 .

[10]  Katsuhiko Sakaue,et al.  Registration and integration of multiple range images for 3-D model construction , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[11]  Jean-Philippe Thirion,et al.  New feature points based on geometric invariants for 3D image registration , 1996, International Journal of Computer Vision.

[12]  C. Goodall Procrustes methods in the statistical analysis of shape , 1991 .

[13]  Kwang-Ho Bae Automated Registration of Unorganised Point Clouds from Terrestrial Laser Scanners , 2004 .

[14]  Michael A. Greenspan,et al.  A nearest neighbor method for efficient ICP , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[15]  Pierre Boulanger Viewpoint Invariant Computation of Surface Curvatures in Range Images , 1995, Research in Computer and Robot Vision.

[16]  Ramesh C. Jain,et al.  Invariant surface characteristics for 3D object recognition in range images , 1985, Comput. Vis. Graph. Image Process..

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

[18]  Fabio Crosilla,et al.  Use of generalised Procrustes analysis for the photogrammetric block adjustment by independent models , 2002 .

[19]  Marc Pouget,et al.  Estimating differential quantities using polynomial fitting of osculating jets , 2003, Comput. Aided Geom. Des..

[20]  Heinrich Niemann,et al.  Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets , 2003, VMV.

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

[22]  Robert Bergevin,et al.  A method for the registration of attributed range images , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[23]  Guy Godin,et al.  Acceleration of Binning Nearest Neighbour Methods , 2000 .

[24]  A. J. Collins,et al.  Matching configurations , 1992 .

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

[26]  J. Gower Generalized procrustes analysis , 1975 .