arXiv subjects

Alexander Effland

Publications and source records attributed to Alexander Effland.

24 records · Page 2Linked to original sources

arXiv2019

Consistent Curvature Approximation on Riemannian Shape Spaces

We describe how to approximate the Riemann curvature tensor as well as sectional curvatures on possibly infinite-dimensional shape spaces that can be thought of as Riemannian manifolds. To this end, we extend the variational time discretization of geodesic calculus presented in Rumpf and Wirth (2015), which just requires an approximation of the squared Riemannian distance that is typically easy to compute. First we obtain first order discrete covariant derivatives via a Schild's ladder type discretization of parallel transport. Second order discrete covariant derivatives are then computed as nested first order discrete covariant derivatives. These finally give rise to an approximation of the curvature tensor. First and second order consistency are proven for the approximations of the covariant derivative and the curvature tensor. The findings are experimentally validated on two-dimensional surfaces embedded in $\mathbb{R}^3$. Furthermore, as a proof of concept the method is applied to the shape space of triangular meshes, and discrete sectional curvature indicatrices are computed on low-dimensional vector bundles.

math.NA↗

arXiv2019

An Optimal Control Approach to Early Stopping Variational Methods for Image Restoration

We investigate a well-known phenomenon of variational approaches in image processing, where typically the best image quality is achieved when the gradient flow process is stopped before converging to a stationary point. This paradox originates from a tradeoff between optimization and modelling errors of the underlying variational model and holds true even if deep learning methods are used to learn highly expressive regularizers from data. In this paper, we take advantage of this paradox and introduce an optimal stopping time into the gradient flow process, which in turn is learned from data by means of an optimal control approach. As a result, we obtain highly efficient numerical schemes that achieve competitive results for image denoising and image deblurring. A nonlinear spectral analysis of the gradient of the learned regularizer gives enlightening insights about the different regularization properties.

math.OC↗

arXiv2017

Image Extrapolation for the Time Discrete Metamorphosis Model - Existence and Applications

The space of images can be equipped with a Riemannian metric measuring both the cost of transport of image intensities and the variation of image intensities along motion lines. The resulting metamorphosis model was introduced and analyzed by Trouvé and Younes, and a variational time discretization for the geodesic interpolation was proposed by Berkels et al. In this paper, this time discrete model is expanded and an image extrapolation via a discrete exponential map is consistently derived for the variational time discretization. For a given weakly differentiable initial image and an initial image variation, the exponential map allows to compute a discrete geodesic extrapolation path in the space of images. It is shown that a time step of this shooting method can be formulated in the associated deformations only. For sufficiently small time steps local existence and uniqueness are proved using a suitable fixed point formulation and the implicit function theorem. A spatial Galerkin discretization with cubic splines on coarse meshes for the deformation and piecewise bilinear finite elements on fine meshes for the image intensities are used to derive a fully practical algorithm. Different applications underline the efficiency and stability of the proposed approach.

math.NA↗

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

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↗