arXiv Analytics

Sign in

arXiv:2207.11141 [math.OC]AbstractReferencesReviewsResources

Deep learning of diffeomorphisms for optimal reparametrizations of shapes

Elena Celledoni, Helge Glöckner, Jørgen Riseth, Alexander Schmeding

Published 2022-07-22Version 1

In shape analysis, one of the fundamental problems is to align curves or surfaces before computing a (geodesic) distance between these shapes. To find the optimal reparametrization realizing this alignment is a computationally demanding task which leads to an optimization problem on the diffeomorphism group. In this paper, we construct approximations of orientation-preserving diffeomorphisms by composition of elementary diffeomorphisms to solve the approximation problem. We propose a practical algorithm implemented in PyTorch which is applicable both to unparametrized curves and surfaces. We derive universal approximation results and obtain bounds for the Lipschitz constant of the obtained compositions of diffeomorphisms.

Comments: 26 pages, 11 figures. Submitted to SIAM Journal of Scientific Computing
Categories: math.OC, cs.LG, math.DG
Subjects: 65K10, 58D05, 46T10
Related articles: Most relevant | Search more
arXiv:2008.12702 [math.OC] (Published 2020-08-28)
Control On the Manifolds Of Mappings As a Setting For Deep Learning
arXiv:1712.04825 [math.OC] (Published 2017-12-13)
Explicit bounds for Lipschitz constant of solution to basic problem in calculus of variations
arXiv:1807.01083 [math.OC] (Published 2018-07-03)
A Mean-Field Optimal Control Formulation of Deep Learning