loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
Conformal Metrics and True "Gradient Flows" for Curves
Beijing, China
October 17-October 20
ISBN: 0-7695-2334-X
Anthony Yezzi, Georgia Institute of Technology
Andrea Mennucci, Scuola Normale Superiore
We wish to endow the manifold M of smooth curves in ℝⁿ with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c₀ and c₁ as trajectories with computable lengths which are independent of the parameterization or representation of the two curves (and the curves making up the morph between them). We may then define the distance between the two curves using the trajectory of minimal length (geodesic) between them, assuming such a minimizing trajectory exists. At first we attempt to utilize the metric structure implied rather unanimously by the past twenty years or so of shape optimization literature in computer vision. This 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. Surprisingly, this implied metric yields a pathological and useless notion of distance between curves. In this paper, we show how this metric can be minimally modified using conformal factors the depend upon a curve?s total arclength. A nice property of these new conformal metrics is that all active contour models that have been called "gradient flows" in the past will constitute true gradient flows with respect to these new metrics under specfic time reparameterizations.
Citation:
Anthony Yezzi, Andrea Mennucci, "Conformal Metrics and True "Gradient Flows" for Curves," iccv, vol. 1, pp.913-919, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.