arXiv subjects

Martin Rumpf

Publications and source records attributed to Martin Rumpf.

49 records · Page 3Linked to original sources

arXiv2015

Time Discrete Geodesic Paths in the Space of Images

In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and effective variational time discretization of geodesics paths is proposed. This requires to minimize a discrete path energy consisting of a sum of consecutive image matching functionals over a set of image intensity maps and pairwise matching deformations. For square-integrable input images the existence of discrete, connecting geodesic paths defined as minimizers of this variational problem is shown. Furthermore, $Γ$-convergence of the underlying discrete path energy to the continuous path energy is proved. This includes a diffeomorphism property for the induced transport and the existence of a square-integrable weak material derivative in space and time. A spatial discretization via finite elements combined with an alternating descent scheme in the set of image intensity maps and the set of matching deformations is presented to approximate discrete geodesic paths numerically. Computational results underline the efficiency of the proposed approach and demonstrate important qualitative properties.

math.NA↗

arXiv2015

A Posteriori Error Control for the Binary Mumford-Shah Model

The binary Mumford-Shah model is a widespread tool for image segmentation and can be considered as a basic model in shape optimization with a broad range of applications in computer vision, ranging from basic segmentation and labeling to object reconstruction. This paper presents robust a posteriori error estimates for a natural error quantity, namely the area of the non properly segmented region. To this end, a suitable strictly convex and non-constrained relaxation of the originally non-convex functional is investigated and Repin's functional approach for a posteriori error estimation is used to control the numerical error for the relaxed problem in the $L^2$-norm. In combination with a suitable cut out argument, a fully practical estimate for the area mismatch is derived. This estimate is incorporated in an adaptive meshing strategy. Two different adaptive primal-dual finite element schemes, and the most frequently used finite difference discretization are investigated and compared. Numerical experiments show qualitative and quantitative properties of the estimates and demonstrate their usefulness in practical applications.

math.NA↗

arXiv2015

A generalized model for optimal transport of images including dissipation and density modulation

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.

math.NA↗

arXiv2015

A $BV$ Functional and its Relaxation for Joint Motion Estimation and Image Sequence Recovery

The estimation of motion in an image sequence is a fundamental task in image processing. Frequently, the image sequence is corrupted by noise and one simultaneously asks for the underlying motion field and a restored sequence. In smoothly shaded regions of the restored image sequence the brightness constancy assumption along motion paths leads to a pointwise differential condition on the motion field. At object boundaries which are edge discontinuities both for the image intensity and for the motion field this condition is no longer well defined. In this paper a total-variation type functional is discussed for joint image restoration and motion estimation. This functional turns out not to be lower semicontinuous, and in particular fine-scale oscillations may appear around edges. By the general theory of vector valued $BV$ functionals its relaxation leads to the appearance of a singular part of the energy density, which can be determined by the solution of a local minimization problem at edges. Based on bounds for the singular part of the energy and under appropriate assumptions on the local intensity variation one can exclude the existence of microstructures and obtain a model well-suited for simultaneous image restoration and motion estimation. Indeed, the relaxed model incorporates a generalized variational formulation of the brightness constancy assumption. The analytical findings are related to ambiguity problems in motion estimation such as the proper distinction between foreground and background motion at object edges.

math.AP↗

arXiv2015

A Nested Variational Time Discretization for Parametric Anisotropic Willmore Flow

A variational time discretization of anisotropic Willmore flow combined with a spatial discretization via piecewise affine finite elements is presented. Here, both the energy and the metric underlying the gradient flow are anisotropic, which in particular ensures that Wulff shapes are invariant up to scaling under the gradient flow. In each time step of the gradient flow a nested optimization problem has to be solved. Thereby, an outer variational problem reflects the time discretization of the actual Willmore flow and involves an approximate anisotropic $L^2$-distance between two consecutive time steps and a fully implicit approximation of the anisotropic Willmore energy. The anisotropic mean curvature needed to evaluate the energy integrand is replaced by the time discrete, approximate speed from an inner, fully implicit variational scheme for anisotropic mean curvature motion. To solve the nested optimization problem a Newton method for the associated Lagrangian is applied. Computational results for the evolution of curves underline the robustness of the new scheme, in particular with respect to large time steps.

math.NA↗

arXiv2015

On Isogeometric Subdivision Methods for PDEs on Surfaces

Subdivision surfaces are proven to be a powerful tool in geometric modeling and computer graphics, due to the great flexibility they offer in capturing irregular topologies. This paper discusses the robust and efficient implementation of an isogeometric discretization approach to partial differential equations on surfaces using subdivision methodology. Elliptic equations with the Laplace-Beltrami and the surface bi-Laplacian operator as well as the associated eigenvalue problems are considered. Thereby, efficiency relies on the proper choice of a numerical quadrature scheme which preserves the expected higher order consistency. A particular emphasis is on the robustness of the approach in the vicinity of extraordinary vertices. In this paper, the focus is on Loop's subdivision scheme on triangular meshes. Based on a series of numerical experiments, different quadrature schemes are compared and a mid-edge quadrature, which is easy-to-implement via lookup tables, turns out to be a preferable choice due to its robustness and efficiency.

math.NA↗

arXiv2015

Bézier curves in the space of images

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.

math.NA↗

arXiv2015

Hysteresis in Magnetic Shape Memory Composites: Modeling and Simulation

Magnetic shape memory alloys are characterized by the coupling between a structural phase transition and magnetic one. This permits to control the shape change via an external magnetic field, at least in single crystals. Composite materials with single-crystalline particles embedded in a softer matrix have been proposed as a way to overcome the blocking of the transformation at grain boundaries. We investigate hysteresis phenomena for small NiMnGa single crystals embedded in a polymer matrix for slowly varying magnetic fields. The evolution of the microstructure is studied within the rate-independent variational framework proposed by Mielke and Theil (1999). The underlying variational model incorporates linearized elasticity, micromagnetism, stray field and a dissipation term proportional to the volume swept by the phase boundary. The time discretization is based on an incremental minimization of the sum of energy and dissipation. A backtracking approach is employed to approximately ensure the global minimality condition. We illustrate and discuss the influence of the particle geometry (volume fraction, shape, arrangement) and the polymer elastic parameters on the observed hysteresis and compare with recent experimental results.

math.NA↗

arXiv2015

A posteriori error estimates for sequential laminates in shape optimization

A posteriori error estimates are derived in the context of two-dimensional structural elastic shape optimization under the compliance objective. It is known that the optimal shape features are microstructures that can be constructed using sequential lamination. The descriptive parameters explicitly depend on the stress. To derive error estimates the dual weighted residual approach for control problems in PDE constrained optimization is employed, involving the elastic solution and the microstructure parameters. Rigorous estimation of interpolation errors ensures robustness of the estimates while local approximations are used to obtain fully practical error indicators. Numerical results show sharply resolved interfaces between regions of full and intermediate material density.

math.NA↗

arXiv2015

3D Adaptive Central Schemes: part I Algorithms for Assembling the Dual Mesh

Central schemes are frequently used for incompressible and compressible flow calculations. The present paper is the first in a forthcoming series where a new approach to a 2nd order accurate Finite Volume scheme operating on cartesian grids is discussed. Here we start with an adaptively refined cartesian primal grid in 3D and present a construction technique for the staggered dual grid based on $L^{\infty}$-Voronoi cells. The local refinement constellation on the primal grid leads to a finite number of uniquely defined local patterns on a primal cell. Assembling adjacent local patterns forms the dual grid. All local patterns can be analysed in advance. Later, running the numerical scheme on staggered grids, all necessary geometric information can instantly be retrieved from lookup-tables. The new scheme is compared to established ones in terms of algorithmical complexity and computational effort.

math.NA↗

arXiv2013

Variational time discretization of geodesic calculus

We analyze a variational time discretization of geodesic calculus on finite- and certain classes of infinite-dimensional Riemannian manifolds. We investigate the fundamental properties of discrete geodesics, the associated discrete logarithm, discrete exponential maps, and discrete parallel transport, and we prove convergence to their continuous counterparts. The presented analysis is based on the direct methods in the calculus of variation, on $Γ$-convergence, and on weighted finite element error estimation. The convergence results of the discrete geodesic calculus are experimentally confirmed for a basic model on a two-dimensional Riemannian manifold. This provides a theoretical basis for applications in computer vision: In particular, discrete geodesics offer an effective tool for shape morphing and the computation of a distance between shapes, the discrete logarithm allows a linear representation of strongly nonlinear shape variability, the discrete exponential map provides a robust tool for shape extrapolation, and the discrete parallel transport can be used to transfer geometric details from one shape to another. The basic operations are exemplarily illustrated for two different shape spaces, the space of viscous volumetric objects and the space of discrete viscous shells.

math.NA↗

arXiv2013

Cortical Surface Co-Registration based on MRI Images and Photos

Brain shift, i.e. the change in configuration of the brain after opening the dura mater, is a key problem in neuronavigation. We present an approach to co-register intra-operative microscope images with pre-operative MRI to adapt and optimize intra-operative neuronavigation. The tools are a robust classification of sulci on MRI extracted cortical surfaces, guided user marking of most prominent sulci on a microscope image, and the actual variational registration method with a fidelity energy for 3D deformations of the cortical surface combined with a higher order, linear elastica type prior energy. Furthermore, the actual registration is validated on an artificial testbed with known ground truth deformation and on real data of a neuro clinical patient.

cs.CV↗

arXiv2012

Discrete geodesic calculus in the space of viscous fluidic objects

Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity measure is derived from a deformation energy whose Hessian reproduces the underlying Riemannian metric, and it is used to define length and energy of discrete paths in shape space. The notion of discrete geodesics defined as energy minimizing paths gives rise to a discrete logarithmic map, a variational definition of a discrete exponential map, and a time discrete parallel transport. This new concept is applied to a shape space in which shapes are considered as boundary contours of physical objects consisting of viscous material. The flexibility and computational efficiency of the approach is demonstrated for topology preserving shape morphing, the representation of paths in shape space via local shape variations as path generators, shape extrapolation via discrete geodesic flow, and the transfer of geometric features.

math.NA↗