A posteriori error control for the binary Mumford-Shah model

DOI10.1090/mcom/3138zbMath1361.49014arXiv1505.05284MaRDI QIDQ2970099

Martin Rumpf, Benjamin Berkels, Alexander Effland

Publication date: 27 March 2017

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

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

zbMATH Keywords

finite difference discretization; a-posteriori error estimation; mesh refinement strategy; binary Mumford-Shah model; primal-dual finite element schemes

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65L20: Stability and convergence of numerical methods for ordinary differential equations

53C22: Geodesics in global differential geometry

49M25: Discrete approximations in optimal control

Related Items

Iterative finite element solution of a constrained total variation regularized model problem

Uses Software

• CHOLMOD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nonlinear total variation based noise removal algorithms
• On total variation minimization and surface evolution using parametric maximum flows
• Variational problems in SBV and image segmentation
• A posteriori estimates for partial differential equations
• Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
• Variational methods in image segmentation with 7 image processing experiments
• An algorithm for total variation minimization and applications
• Implementation of an adaptive finite-element approximation of the Mumford-Shah functional
• A posteriori error analysis via duality theory. With applications in modeling and numerical approximations.
• The calibration method for the Mumford-Shah functional and free-discontinuity problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Optimal approximations by piecewise smooth functions and associated variational problems
• Global Solutions of Variational Models with Convex Regularization
• Error Bounds for Finite-Difference Methods for Rudin–Osher–Fatemi Image Smoothing
• The Split Bregman Method for L1-Regularized Problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Projected gradient methods for linearly constrained problems
• 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: Table 1.
• Discrete approximation of the Mumford-Shah functional in dimension two
• Least squares quantization in PCM
• Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
• Image Segmentation by Variational Methods: Mumford and Shah Functional and the Discrete Approximations
• A Convex Approach to Minimal Partitions
• A posteriori error estimation for variational problems with uniformly convex functionals
• Error control and adaptivity for a variational model problem defined on functions of bounded variation