Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration

This paper deals with the matching of geometric shapes. Our primary contribution is the use of a simple, robust, rich and efficient way to represent shapes, the level set representations according to singed distance transforms. Based on these representations we propose a variational framework for global as well as local shape registration that can be extended to deal with structures of higher dimension. The optimization criterion is invariant to rotation, translation and scale and combines efficiently a global motion model with local pixel-wise deformations. Promising results are obtained on examples showing small and large global deformations as well as arbitrary topological changes.

[1]  O. Faugeras,et al.  A variational approach to multi-modal image matching , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

[2]  Richard Szeliski,et al.  Recovering the Position and Orientation of Free-Form Objects from Image Contours Using 3D Distance Maps , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Michael I. Miller,et al.  Landmark matching via large deformation diffeomorphisms , 2000, IEEE Trans. Image Process..

[4]  Remco C. Veltkamp,et al.  State of the Art in Shape Matching , 2001, Principles of Visual Information Retrieval.

[5]  Andrew W. Fitzgibbon,et al.  Robust Registration of 2D and 3D Point Sets , 2003, BMVC.

[6]  Max A. Viergever,et al.  Efficient and reliable schemes for nonlinear diffusion filtering , 1998, IEEE Trans. Image Process..

[7]  Nikos Paragios,et al.  Shape Priors for Level Set Representations , 2002, ECCV.

[8]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[9]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[10]  Michael Isard,et al.  Active Contours , 2000, Springer London.

[11]  Paul A. Viola,et al.  Alignment by Maximization of Mutual Information , 1997, International Journal of Computer Vision.

[12]  Alan L. Yuille,et al.  FORMS: A flexible object recognition and modelling system , 1996, International Journal of Computer Vision.

[13]  Timothy F. Cootes,et al.  Active Shape Models-Their Training and Application , 1995, Comput. Vis. Image Underst..

[14]  Ali Shokoufandeh,et al.  Shock Graphs and Shape Matching , 1998, International Journal of Computer Vision.

[15]  Isabelle Herlin,et al.  Curves matching using geodesic paths , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[16]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[17]  Cengizhan Ozturk,et al.  Multidimensional Alignment Using the Euclidean Distance Transform , 1997, CVGIP Graph. Model. Image Process..

[18]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[19]  Max A. Viergever,et al.  A survey of medical image registration , 1998, Medical Image Anal..

[20]  R. Malladi,et al.  A Unified Framework for Shape Segmentation, Representation, and Recognition , 1994 .

[21]  Anand Rangarajan,et al.  A new algorithm for non-rigid point matching , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[22]  Jitendra Malik,et al.  Matching Shapes , 2001, ICCV.

[23]  SiddiqiKaleem,et al.  Shock Graphs and Shape Matching , 1999 .

[24]  Stanley Osher,et al.  Level Set Methods , 2003 .

[25]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[26]  Philip N. Klein,et al.  Recognition of Shapes by Editing Shock Graphs , 2001, ICCV.