Philipp Harms

Martin Bauer, Martins Bruveris, Philipp Harms et al.

Statistical shape analysis can be done in a Riemannian framework by endowing the set of shapes with a Riemannian metric. Sobolev metrics of order two and higher on shape spaces of parametrized or unparametrized curves have several desirable properties not present in lower order metrics, but their discretization is still largely missing. In this paper, we present algorithms to numerically solve the geodesic initial and boundary value problems for these metrics. The combination of these algorithms enables one to compute Karcher means in a Riemannian gradient-based optimization scheme and perform principal component analysis and clustering. Our framework is sufficiently general to be applicable to a wide class of metrics. We demonstrate the effectiveness of our approach by analyzing a collection of shapes representing HeLa cell nuclei.

Philipp Harms, Marvin S. Müller

We establish weak convergence rates for noise discretizations of a wide class of stochastic evolution equations with non-regularizing semigroups and additive or multiplicative noise. This class covers the nonlinear stochastic wave, HJMM, stochastic Schrödinger and linearized stochastic Korteweg-de Vries equation. For several important equations, including the stochastic wave equation, previous methods give only suboptimal rates, whereas our rates are essentially sharp.

Maren Hackenberg, Philipp Harms, Michelle Pfaffenlehner et al.

Longitudinal biomedical data are often characterized by a sparse time grid and individual-specific development patterns. Specifically, in epidemiological cohort studies and clinical registries we are facing the question of what can be learned from the data in an early phase of the study, when only a baseline characterization and one follow-up measurement are available. Inspired by recent advances that allow to combine deep learning with dynamic modeling, we investigate whether such approaches can be useful for uncovering complex structure, in particular for an extreme small data setting with only two observations time points for each individual. Irregular spacing in time could then be used to gain more information on individual dynamics by leveraging similarity of individuals. We provide a brief overview of how variational autoencoders (VAEs), as a deep learning approach, can be linked to ordinary differential equations (ODEs) for dynamic modeling, and then specifically investigate the feasibility of such an approach that infers individual-specific latent trajectories by including regularity assumptions and individuals' similarity. We also provide a description of this deep learning approach as a filtering task to give a statistical perspective. Using simulated data, we show to what extent the approach can recover individual trajectories from ODE systems with two and four unknown parameters and infer groups of individuals with similar trajectories, and where it breaks down. The results show that such dynamic deep learning approaches can be useful even in extreme small data settings, but need to be carefully adapted.

Martin Bauer, Nicolas Charon, Philipp Harms et al.

Surface comparison and matching is a challenging problem in computer vision. While reparametrization-invariant Sobolev metrics provide meaningful elastic distances and point correspondences via the geodesic boundary value problem, solving this problem numerically tends to be difficult. Square root normal fields (SRNF) considerably simplify the computation of certain elastic distances between parametrized surfaces. Yet they leave open the issue of finding optimal reparametrizations, which induce elastic distances between unparametrized surfaces. This issue has concentrated much effort in recent years and led to the development of several numerical frameworks. In this paper, we take an alternative approach which bypasses the direct estimation of reparametrizations: we relax the geodesic boundary constraint using an auxiliary parametrization-blind varifold fidelity metric. This reformulation has several notable benefits. By avoiding altogether the need for reparametrizations, it provides the flexibility to deal with simplicial meshes of arbitrary topologies and sampling patterns. Moreover, the problem lends itself to a coarse-to-fine multi-resolution implementation, which makes the algorithm scalable to large meshes. Furthermore, this approach extends readily to higher-order feature maps such as square root curvature fields and is also able to include surface textures in the matching problem. We demonstrate these advantages on several examples, synthetic and real.

Martin Bauer, Martins Bruveris, Philipp Harms et al.

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 the zero, first, and second order terms of the metric can be chosen freely. Moreover, due to its generality, it could be applied to more general spaces of mapping. We demonstrate the effectiveness of our approach by analyzing a collection of shapes representing physical objects.

Martin Bauer, Martins Bruveris, Philipp Harms et al.

In the recent years, Riemannian shape analysis of curves and surfaces has found several applications in medical image analysis. In this paper we present a numerical discretization of second order Sobolev metrics on the space of regular curves in Euclidean space. This class of metrics has several desirable mathematical properties. We propose numerical solutions for the initial and boundary value problems of finding geodesics. These two methods are combined in a Riemannian gradient-based optimization scheme to compute the Karcher mean. We apply this to a study of the shape variation in HeLa cell nuclei and cycles of cardiac deformations, by computing means and principal modes of variations.