Computable Elastic Distances Between Shapes

@article{Younes1998ComputableED,
  title={Computable Elastic Distances Between Shapes},
  author={Laurent Younes},
  journal={SIAM J. Appl. Math.},
  year={1998},
  volume={58},
  pages={565-586}
}
  • L. Younes
  • Published 1 April 1998
  • Computer Science
  • SIAM J. Appl. Math.
We dene distances between geometric curves by the square root of the minimal energy required to transform one curve into the other. The energy is formally dened from a left invariant Riemannian distance on an innite dimensional group acting on the curves, which can be explicitly computed. The obtained distance boils down to a variational problem for which an optimal matching between the curves has to be computed. An analysis of the distance when the curves are polygonal leads to a numerical… 

Figures and Tables from this paper

A distance for elastic matching in object recognition
TLDR
An analysis of the distance when the curves are polygonal leads to a numerical procedure for the solution of the variational problem, which can efficiently be implemented, as illustrated by experiments.
Similarity Metric for Curved Shapes in Euclidean Space
TLDR
The proposed method represents a given curve as a point in the deformation space, the direct product of rigid transformation matrices, such that the successive action of the matrices on a fixed starting point reconstructs the full curve.
Simplifying Transforms for General Elastic Metrics on the Space of Plane Curves
TLDR
This paper extends the transformations appearing in the existing literature to a family of isometries, which take any elastic metric to the flat L 2 metric, and extends the transforms to treat piecewise linear curves and demonstrates the existence of optimal matchings over the diffeomorphism group in this setting.
A Discrete Framework to Find the Optimal Matching Between Manifold-Valued Curves
TLDR
A simple algorithm is introduced that finds an optimal matching between two curves by computing the geodesic of the infinite-dimensional manifold of curves that is at all time horizontal to the fibers of the shape bundle, and comparison with dynamic programming is established.
Matching Shapes Using the Current Distance
TLDR
An interesting aspect of this work is that it can compute the current distance between curves, surfaces, and higher-order manifolds via a simple reduction to instances of weighted point sets, thus obviating the need for different kind of algorithms for different kinds of shapes.
Fast Approximation of Distance Between Elastic Curves using Kernels
TLDR
This paper proposes a new procedure for metric approximation using the framework of kernel functions and demonstrates that this provides a fast approximation of the metric while preserving its invariance properties.
A New Variational Model for Shape Graph Registration with Partial Matching Constraints
This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with
Metric registration of curves and surfaces using optimal control
Elastic Geodesic Paths in Shape Space of Parameterized Surfaces
TLDR
A novel Riemannian framework for shape analysis of parameterized surfaces provides efficient algorithms for computing geodesic paths which, in turn, are important for comparing, matching, and deforming surfaces.
Conformal metrics and true "gradient flows" for curves
  • A. Yezzi, A. Mennucci
  • Computer Science, Mathematics
    Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
  • 2005
TLDR
This paper shows how this Riemannian metric arises as the unique metric which validates the common references to a wide variety of contour evolution models in the literature as "gradient flows" to various formulated energy functionals using conformal factors that depend upon a curve's total arclength.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
SHAPE MANIFOLDS, PROCRUSTEAN METRICS, AND COMPLEX PROJECTIVE SPACES
The shape-space l. k m whose points a represent the shapes of not totally degenerate /c-ads in IR m is introduced as a quotient space carrying the quotient metric. When m = 1, we find that Y\ = S k ~
On the Shape of Plane Images
TLDR
A definition of shape in terms of transformation groups, where the transformations need not be rigid and linear, but more structured than arbitrary homeomorphisms is given, and a limit theorem for the prior measures is presented.
The least action principle and the related concept of generalized flows for incompressible perfect fluids
The link between the Euler equations of perfect incompressible flows and the Least Action Principle has been known for a long time [I]. Solu- tions can be considered as geodesic curves along the
Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images
TLDR
A 3-D generalization of the balloon model as a3-D deformable surface, which evolves in 3D images, is presented and properties of energy-minimizing surfaces concerning their relationship with 3- D edge points are shown.
Generalized Deformable Models, Statistical Physics, and Matching Problems
  • A. Yuille
  • Computer Science
    Neural Computation
  • 1990
TLDR
Techniques from statistical physics are used to exploit the power of statistical techniques to put global constraints on the set of allowable states of the binary matching elements and be preferable to existing methods of imposing such constraints by adding bias terms in the energy functions.
ON THE GEOMETRY OF THE GROUP OF DIFFEOMORPHISMS AND THE DYNAMICS OF AN IDEAL INCOMPRESSIBLE FLUID
The author studies the geometric properties of the group of volume-preserving diffeomorphisms of a region. This group is the configuration space of an ideal incompressible fluid, the trajectories of
Object Recognition, A Survey of the Literature
TLDR
This paper surveys the techniques which have been applied to the problem of recognising three-dimensional objects in two-dimensional images and suggests that it may not be possible to perform a perfect segmentation of the image before proceeding to higher level processing.
Structural Image Restoration through Deformable Templates
Abstract Prior knowledge on the space of possible images is given in the form of a function or template in some domain. The set of all possible true images is assumed to be formed by a composition of
Tracking Points on Deformable Objects Using Curvature Information
TLDR
A significant improvement is presented to the approach of Duncan et al. to analyze the deformations of curves in sequences of 2D images based on the paradigm that high curvature points usually possess an anatomical meaning, and are therefore good landmarks to guide the matching process.
...
1
2
3
4
5
...