3D shape registration using regularized medial scaffolds

This work proposes a method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods are based on the iterative closest point (ICP) algorithm, which requires an initial alignment close to the globally optimal solution to ensure convergence to a valid solution. Furthermore, it can also fail when there are points in one dataset with no corresponding matches in the other dataset. The proposed method automatically finds an initial alignment close to the global optimal by using the medial structure of the datasets. For this purpose, we first compute the medial scaffold of a 3D dataset: a 3D graph made of special shock curves linking special shock nodes. This medial scaffold is then regularized exploiting the known transitions of the 3D medial axis under deformation or perturbation of the input data. The resulting simplified medial scaffolds are then registered using a modified graduated assignment graph matching algorithm. The proposed method shows robustness to noise, shape deformations, and varying surface sampling densities.

[1]  Benjamin B. Kimia,et al.  Computation of the shock scaffold for unorganized point clouds in 3D , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[2]  Luc Van Gool,et al.  Combining texture and shape for automatic crude patch registration , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[3]  Patrick J. Flynn,et al.  A Survey Of Free-Form Object Representation and Recognition Techniques , 2001, Comput. Vis. Image Underst..

[4]  Richard Sinkhorn A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[5]  Sven J. Dickinson,et al.  Skeleton based shape matching and retrieval , 2003, 2003 Shape Modeling International..

[6]  HARRY BLUM,et al.  Shape description using weighted symmetric axis features , 1978, Pattern Recognit..

[7]  Benjamin B. Kimia,et al.  Boundary Smoothing via Symmetry Transforms , 2001, Journal of Mathematical Imaging and Vision.

[8]  GoolLuc Van,et al.  Automatic crude patch registration , 2002 .

[9]  Ioannis Stamos,et al.  New Methods for Digital Modeling of Historic Sites , 2003, IEEE Computer Graphics and Applications.

[10]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[11]  Benjamin B. Kimia,et al.  Towards surface regularization via medial axis transitions , 2004, ICPR 2004.

[12]  Tobias Isenberg,et al.  3D Shape Matching Using Skeleton Graphs , 2004, SimVis.

[13]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[14]  Benjamin B. Kimia,et al.  Symmetry-Based Indexing of Image Databases , 1998, J. Vis. Commun. Image Represent..

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

[16]  Benjamin B. Kimia,et al.  On the Intrinsic Reconstruction of Shape from Its Symmetries , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..