Stefan Simon

Alexander Effland, Martin Rumpf, Stefan Simon et al.

Bézier curves are a widespread tool for the design of curves in Euclidian space. This paper generalizes the notion of Bézier curves to the infinite-dimensional space of images. To this end the space of images is equipped with a Riemannian metric which measures the cost of image transport and intensity variation in the sense of the metamorphosis model by Miller and Younes. Bézier curves are then computed via the Riemannian version of de Casteljau's algorithm, which is based on a hierarchical scheme of convex combination along geodesic curves. Geodesics are approximated using a variational discretization of the Riemannian path energy. This leads to a generalized de Casteljau method to compute suitable discrete Bézier curves in image space. Selected test cases demonstrate qualitative properties of the approach. Furthermore, a Bézier approach for the modulation of face interpolation and shape animation via image sketches is presented.

Jan Maas, Martin Rumpf, Stefan Simon

We present a generalized optimal transport model in which the mass-preserving constraint for the $L^2$-Wasserstein distance is relaxed by introducing a source term in the continuity equation. The source term is also incorporated in the path energy by means of its squared $L^2$-norm in time of a functional with linear growth in space. This extension of the original transport model enables local density modulation, which is a desirable feature in applications such as image warping and blending. A key advantage of the use of a functional with linear growth in space is that it allows for singular sources and sinks, which can be supported on points or lines. On a technical level, the $L^2$-norm in time ensures a disintegration of the source in time, which we use to obtain the well-posedness of the model and the existence of geodesic paths. Furthermore, a numerical scheme based on the proximal splitting approach (Papadakis et al., 2014) is presented. We compare our model with the corresponding model involving the $L^2(L^2)$-norm of the source, which merges the metamorphosis approach and the optimal transport approaches in imaging. Selected numerical test cases show strikingly different behaviour.

Peter Hornung, Martin Rumpf, Stefan Simon

We consider the problem of an optimal distribution of soft and hard material for nonlinearly elastic planar beams. We prove that under gravitational force the optimal distribution involves no microstructure and is ordered, and we provide numerical simulations confirming and extending this observation.

Patrick Dondl, Patrina S. P. Poh, Martin Rumpf et al.

This paper deals with the simulateneous optimization of a subset $\mathcal{O}_0$ of some domain $Ω$ and its complement $\mathcal{O}_1 = Ω\setminus \overline{\mathcal{O}}_0$ both considered as separate elastic objects subject to a set of loading scenarios. If one asks for a configuration which minimizes the maximal elastic cost functional both phases compete for space since elastic shapes usually get mechanically more stable when being enlarged. Such a problem arises in biomechanics where a bioresorbable polymer scaffold is implanted in place of lost bone tissue and in a regeneration phase new bone tissue grows in the scaffold complement via osteogenesis. In fact, the polymer scaffold should be mechanically stable to bear loading in the early stage regeneration phase and at the same time the new bone tissue grown in the complement of this scaffold should as well bear the loading. Here, this optimal subdomain splitting problem with appropriate elastic cost functionals is introduced and existence of optimal two phase configurations is established for a regularized formulation. Furthermore, based on a phase field approximation a finite element discretization is derived. Numerical experiments are presented for the design of optimal periodic scaffold microstructure.

Matthias Erbar, Martin Rumpf, Bernhard Schmitzer et al.

In this paper we investigate the numerical approximation of an analogue of the Wasserstein distance for optimal transport on graphs that is defined via a discrete modification of the Benamou--Brenier formula. This approach involves the logarithmic mean of measure densities on adjacent nodes of the graph. For this model a variational time discretization of the probability densities on graph nodes and the momenta on graph edges is proposed. A robust descent algorithm for the action functional is derived, which in particular uses a proximal splitting with an edgewise nonlinear projection on the convex subgraph of the logarithmic mean. Thereby, suitable chosen slack variables avoid a global coupling of probability densities on all graph nodes in the projection step. For the time discrete action functional $Γ$--convergence to the time continuous action is established. Numerical results for a selection of test cases show qualitative and quantitative properties of the optimal transport on graphs. Finally, we use our algorithm to implement a JKO scheme for the gradient flow of the entropy in the discrete transportation distance, which is known to coincide with the underlying Markov semigroup, and test our results against a classical backward Euler discretization of this discrete heat flow.

Jan Maas, Martin Rumpf, Carola Schönlieb et al.

In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying Riemannian metric measures the rate of transport cost and the rate of viscous dissipation. Furthermore, the model is capable to deal with strongly varying image contrast and explicitly allows for sources and sinks in the transport equations which are incorporated in the metric related to the metamorphosis approach by Trouvé and Younes. In the non-viscous case with source term existence of geodesic paths is proven in the space of measures. The proposed model is explored on the range from merely optimal transport to strongly dissipative dynamics. For this model a robust and effective variational time discretization of geodesic paths is proposed. This requires to minimize a discrete path energy consisting of a sum of consecutive image matching functionals. These functionals are defined on corresponding pairs of intensity functions and on associated pairwise matching deformations. Existence of time discrete geodesics is demonstrated. Furthermore, a finite element implementation is proposed and applied to instructive test cases and to real images. In the non-viscous case this is compared to the algorithm proposed by Benamou and Brenier including a discretization of the source term. Finally, the model is generalized to define discrete weighted barycentres with applications to textures and objects.