Approximations of Shape Metrics and Application to Shape Warping and Empirical Shape Statistics

Abstract This paper proposes a framework for dealing with several problems related to the analysis of shapes. Two related such problems are the definition of the relevant set of shapes and that of defining a metric on it. Following a recent research monograph by Delfour and Zolésio [11], we consider the characteristic functions of the subsets of R2 and their distance functions. The L2 norm of the difference of characteristic functions, the L∞ and the W1,2 norms of the difference of distance functions define interesting topologies, in particular the well-known Hausdorff distance. Because of practical considerations arising from the fact that we deal with image shapes defined on finite grids of pixels, we restrict our attention to subsets of ℝ2 of positive reach in the sense of Federer [16], with smooth boundaries of bounded curvature. For this particular set of shapes we show that the three previous topologies are equivalent. The next problem we consider is that of warping a shape onto another by infinitesimal gradient descent, minimizing the corresponding distance. Because the distance function involves an inf, it is not differentiable with respect to the shape. We propose a family of smooth approximations of the distance function which are continuous with respect to the Hausdorff topology, and hence with respect to the other two topologies. We compute the corresponding Gâteaux derivatives. They define deformation flows that can be used to warp a shape onto another by solving an initial value problem.We show several examples of this warping and prove properties of our approximations that relate to the existence of local minima. We then use this tool to produce computational definitions of the empirical mean and covariance of a set of shape examples. They yield an analog of the notion of principal modes of variation. We illustrate them on a variety of examples.

[1]  G. Matheron Random Sets and Integral Geometry , 1976 .

[2]  H. Soner,et al.  Level set approach to mean curvature flow in arbitrary codimension , 1996 .

[3]  Alain Trouvé,et al.  Diffeomorphisms Groups and Pattern Matching in Image Analysis , 1998, International Journal of Computer Vision.

[4]  Olivier D. Faugeras,et al.  Statistical shape influence in geodesic active contours , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[5]  Laurent Younes,et al.  Optimal matching between shapes via elastic deformations , 1999, Image Vis. Comput..

[6]  S. Osher,et al.  Regular Article: A PDE-Based Fast Local Level Set Method , 1999 .

[7]  Xavier Pennec L'incertitude dans les problèmes de reconnaissance et de recalage - Applications en imagerie médicale et biologie moléculaire , 1996 .

[8]  Laurent Younes,et al.  Computable Elastic Distances Between Shapes , 1998, SIAM J. Appl. Math..

[9]  C. Small The statistical theory of shape , 1996 .

[10]  Olivier Faugeras,et al.  Reconciling Distance Functions and Level Sets , 2000, J. Vis. Commun. Image Represent..

[11]  Hwan Pyo Moon,et al.  MATHEMATICAL THEORY OF MEDIAL AXIS TRANSFORM , 1997 .

[12]  Anuj Srivastava,et al.  Analysis of planar shapes using geodesic paths on shape spaces , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Ulf Grenander,et al.  Hands: A Pattern Theoretic Study of Biological Shapes , 1990 .

[14]  H. Fédérer,et al.  Hausdorff Measure and Lebesgue Area. , 1951, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Clotilde Léger,et al.  et trouve une fonction , 2000 .

[16]  W. Kendall Probability, Convexity, and Harmonic Maps with Small Image I: Uniqueness and Fine Existence , 1990 .

[17]  F. Bookstein Size and Shape Spaces for Landmark Data in Two Dimensions , 1986 .

[18]  M. Fréchet Les éléments aléatoires de nature quelconque dans un espace distancié , 1948 .

[19]  M. Delfour,et al.  Shape Analysis via Oriented Distance Functions , 1994 .

[20]  Alain Trouvé,et al.  Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals , 2000, ECCV.

[21]  M. Delfour,et al.  Shape analysis via dis-tance functions: Local theory , 1998 .

[22]  Paul M. Thompson,et al.  The role of image registration in brain mapping , 2001, Image Vis. Comput..

[23]  S. Osher,et al.  A PDE-Based Fast Local Level Set Method 1 , 1998 .

[24]  S. Osher,et al.  Geometric Level Set Methods in Imaging, Vision, and Graphics , 2011, Springer New York.

[25]  Stefano Soatto,et al.  DEFORMOTION: Deforming Motion, Shape Average and the Joint Registration and Segmentation of Images , 2002, ECCV.

[26]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[27]  James A. Sethian,et al.  The Fast Construction of Extension Velocities in Level Set Methods , 1999 .

[28]  G. Choquet,et al.  Cours d'analyse , 2022 .

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

[30]  S. Osher,et al.  A level set approach for computing solutions to incompressible two-phase flow , 1994 .

[31]  U. Grenander,et al.  Computational anatomy: an emerging discipline , 1998 .

[32]  Olivier Faugeras,et al.  Approximations of Shape Metrics and Application to Shape Warping and Empirical Shape Statistics , 2006, Statistics and Analysis of Shapes.

[33]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[34]  Laurent Younes,et al.  Invariance, déformations et reconnaissance de formes , 2004 .

[35]  H. Karcher Riemannian center of mass and mollifier smoothing , 1977 .

[36]  W. D. Evans,et al.  PARTIAL DIFFERENTIAL EQUATIONS , 1941 .

[37]  D. Kendall A Survey of the Statistical Theory of Shape , 1989 .

[38]  Alex M. Andrew,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition) , 2000 .

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

[40]  W. Rudin Real and complex analysis , 1968 .

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

[42]  Vic Patrangenaru,et al.  Geometry of Shape Spaces , 2006 .

[43]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[44]  Michael I. Miller,et al.  Group Actions, Homeomorphisms, and Matching: A General Framework , 2004, International Journal of Computer Vision.

[45]  D. Kendall SHAPE MANIFOLDS, PROCRUSTEAN METRICS, AND COMPLEX PROJECTIVE SPACES , 1984 .

[46]  J. Dieudonné,et al.  Éléments d'analyse , 1972 .

[47]  Paul Dupuis,et al.  Variational problems on ows of di eomorphisms for image matching , 1998 .