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