Invariant-based registration of surface patches

3D shape models are often put together from several partial reconstructions. There are good algorithms available now to perform the necessary, precise registration automatically, but only after the partial reconstructions have been brought into approximate positions. This paper proposes a technique to do precisely that. Automatic 'crude registration' is illustrated for Euclidean and affine transformations between parts. The technique is based on the extraction and invariant characterisation of bitangent curve pairs. These can be found and matched efficiently. Registration of these curves yields the crude initialisation that more precise registration algorithms like ICP or mutual information maximisation can start from.

[1]  Nicholas Ayache,et al.  3D-2D Projective Registration of Free-Form Curves and Surfaces , 1997, Comput. Vis. Image Underst..

[2]  Shi-Jinn Horng,et al.  Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer , 1997, Comput. Vis. Image Underst..

[3]  Paul A. Viola,et al.  Alignment by Maximization of Mutual Information , 1995, Proceedings of IEEE International Conference on Computer Vision.

[4]  Paul A. Viola.  Alignment by maximisation of mutual information , 1993 .

[5]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Torsion-Based Shape Representation for Space Curves , 1997, Comput. Vis. Image Underst..

[6]  Nicholas Ayache,et al.  Locally affine registration of free-form surfaces , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[7]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

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

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