Procedings of the Proceedings of the 1st International Workshop on DIFFerential Geometry in Computer Vision for Analysis of Sha 2015
DOI: 10.5244/c.29.diffcv.9
|View full text |Cite
|
Sign up to set email alerts
|

Second order elastic metrics on the shape space of curves

Abstract: Second order Sobolev metrics on the space of regular unparametrized planar curves have several desirable completeness properties not present in lower order metrics, but numerics are still largely missing. In this paper, we present algorithms to numerically solve the initial and boundary value problems for geodesics. The combination of these algorithms allows to compute Karcher means in a Riemannian gradient-based optimization scheme. Our framework has the advantage that the constants determining the weights of… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
2

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…Sobolev metrics have been generalized to manifold-valued curves [9,13,25] and to higherdimensional immersed manifolds [3,8]. Numerical discretizations are available for first order metrics [24,27] as well as for second order ones [4,5,6]. See [7] for an overview of Riemannian metrics on spaces of curves and related spaces.…”
Section: Introductionmentioning
confidence: 99%
“…Sobolev metrics have been generalized to manifold-valued curves [9,13,25] and to higherdimensional immersed manifolds [3,8]. Numerical discretizations are available for first order metrics [24,27] as well as for second order ones [4,5,6]. See [7] for an overview of Riemannian metrics on spaces of curves and related spaces.…”
Section: Introductionmentioning
confidence: 99%
“…In the Riemannian setting the length of a path c : 4) and the geodesic distance between two curves c 0 , c 1 ∈ Imm(S 1 , R d ) is the infimum of the lengths of all paths connecting these curves, i.e.,…”
Section: Parametrized Curvesmentioning
confidence: 99%