论文信息 - Optimal matching between shapes via elastic deformations

Optimal matching between shapes via elastic deformations

We describe an elastic matching procedure between plane curves based on computing a minimal deformation cost between the curves. The design of the deformation cost is based on a geodesic distance defined on an infinite dimensional group acting on the curves. The geodesic paths also provide an optimal deformation process, which allows interpolation between any plane curves.

Laurent Younes | L. Younes

[1] Ulf Grenander,et al. On the Shape of Plane Images , 1993, SIAM J. Appl. Math..

[2] I. Holopainen. Riemannian Geometry , 1927, Nature.

[3] Nicholas Ayache,et al. Tracking Points on Deformable Objects Using Curvature Information , 1992, ECCV.

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

[5] Ulf Grenander,et al. General Pattern Theory: A Mathematical Study of Regular Structures , 1993 .

[6] Alberto Del Bimbo,et al. Visual Image Retrieval by Elastic Matching of User Sketches , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7] A. Trouvé. An Approach of Pattern Recognition through Infinite Dimensional Group Action , 1995 .

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

[9] S. Lang. Introduction to Differentiable Manifolds , 1964 .