Benjamin Berkels, Tom Fletcher, Behrend Heeren, Martin Rumpf and Benedikt Wirth Discrete geodesic regression in shape space In Anders Heyden, Fredrik Kahl, Carl Olsson, Magnus Oskarsson, Xue-Cheng Tai, editor, Energy Minimization Methods in Computer Vision and Pattern Recognition, Volume 8081 of Lecture Notes in Computer Science
page 108-122.
Publisher: Springer International
2013 http://dx.doi.org/10.1007/978-3-642-40395-8_9
Abstract: A new approach for the effective computation of geodesic re- gression curves in shape spaces is presented. Here, one asks for a geodesic curve on the shape manifold that minimizes a sum of dissimilarity mea- sures between given two- or three-dimensional input shapes and corre- sponding shapes along the regression curve. The proposed method is based on a variational time discretization of geodesics. Curves in shape space are represented as deformations of suitable reference shapes, which renders the computation of a discrete geodesic as a PDE constrained optimization for a family of deformations. The PDE constraint is de- duced from the discretization of the covariant derivative of the velocity in the tangential direction along a geodesic. Finite elements are used for the spatial discretization, and a hierarchical minimization strategy together with a Lagrangian multiplier type gradient descent scheme is implemented. The method is applied to the analysis of root growth in botany and the morphological changes of brain structures due to aging.