Benjamin Berkels, Michael Buchner, Alexander Effland, Martin Rumpf and Steffen Schmitz-Valckenberg GPU Based Image Geodesics for Optical Coherence Tomography In Bildverarbeitung für die Medizin, Informatik aktuell
page 68--73.
Publisher: Springer
2017 http://dx.doi.org/10.1007/978-3-662-54345-0_21
2015
Benjamin Berkels, Alexander Effland and Martin Rumpf A Posteriori Error Control for the Binary Mumford-Shah Model ArXiv Preprint 2015 http://arxiv.org/abs/1505.05284
Abstract: 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.
Benjamin Berkels, Alexander Effland and Martin Rumpf Time Discrete Geodesic Paths in the Space of Images SIAM J. Imaging Sci., 8(3): 1457-1488 2015 http://dx.doi.org/10.1137/140970719
Abstract: 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.
2013
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.