A posteriori error control for the binary Mumford-Shah model

DOI10.1090/MCOM/3138zbMATH Open1361.49014arXiv1505.05284OpenAlexW2121209083MaRDI QIDQ2970099FDOQ2970099

Authors: Benjamin Berkels, Alexander Effland, Martin Rumpf 

Publication date: 27 March 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1505.05284

Recommendations

• Error control and adaptivity for a variational model problem defined on functions of bounded variation
• Implementation of an adaptive finite-element approximation of the Mumford-Shah functional
• Mumford and Shah model and its applications to image segmentation and image restoration
• A Variational Shape Optimization Approach for Image Segmentation with a Mumford–Shah Functional
• Image segmentation with a finite element method

zbMATH Keywords

finite difference discretizationa-posteriori error estimationmesh refinement strategybinary Mumford-Shah modelprimal-dual finite element schemes

Mathematics Subject Classification ID

Discrete approximations in optimal control (49M25) Geodesics in global differential geometry (53C22) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Stability and convergence of numerical methods for ordinary differential equations (65L20)

Cites Work

• Nonlinear total variation based noise removal algorithms
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Least squares quantization in PCM
• Title not available (Why is that?)
• On total variation minimization and surface evolution using parametric maximum flows
• Title not available (Why is that?)
• The Split Bregman Method for L1-Regularized Problems
• An algorithm for total variation minimization and applications
• Implementation of an adaptive finite-element approximation of the Mumford-Shah functional
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Optimal approximations by piecewise smooth functions and associated variational problems
• Title not available (Why is that?)
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Projected gradient methods for linearly constrained problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete approximation of the Mumford-Shah functional in dimension two
• Title not available (Why is that?)
• Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
• Image Segmentation by Variational Methods: Mumford and Shah Functional and the Discrete Approximations
• A posteriori estimates for partial differential equations
• Variational methods in image segmentation with 7 image processing experiments
• The calibration method for the Mumford-Shah functional and free-discontinuity problems
• Title not available (Why is that?)
• A posteriori error estimation for variational problems with uniformly convex functionals
• Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
• Error Bounds for Finite-Difference Methods for Rudin–Osher–Fatemi Image Smoothing
• Convergence of an Iterative Method for Total Variation Denoising
• Analysis of total variation flow and its finite element approximations
• Broken Sobolev space iteration for total variation regularized minimization problems
• A Convex Approach to Minimal Partitions
• Global solutions of variational models with convex regularization
• A posteriori error analysis via duality theory. With applications in modeling and numerical approximations.
• Variational problems in SBV and image segmentation
• Error control and adaptivity for a variational model problem defined on functions of bounded variation

Cited In (6)

• Singular solutions, graded meshes, and adaptivity for total-variation regularized minimization problems
• Crouzeix-Raviart approximation of the total variation on simplicial meshes
• Discrete total variation with finite elements and applications to imaging
• Total Generalized Variation for Piecewise Constant Functions on Triangular Meshes with Applications in Imaging
• Iterative finite element solution of a constrained total variation regularized model problem
• Convex lifting-type methods for curvature regularization

Uses Software

• CHOLMOD

This page was built for publication: A posteriori error control for the binary Mumford-Shah model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970099)