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 uniformly 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, fully practical estimates for the area mismatch are derived. This estimate is incorporated in an adaptive mesh refinement strategy. Two different adaptive primal-dual finite element schemes, a dual gradient descent scheme, 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. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1090/mcom/3138 | MATHEMATICS OF COMPUTATION |
Field | DocType | Volume |
Mathematical optimization,Segmentation,A priori and a posteriori,Finite element method,Image segmentation,Error detection and correction,Convex function,Shape optimization,Mathematics,Binary number | Journal | 86 |
Issue | ISSN | Citations |
306 | 0025-5718 | 1 |
PageRank | References | Authors |
0.36 | 14 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Benjamin Berkels | 1 | 97 | 12.86 |
Alexander Effland | 2 | 9 | 5.41 |
Martin Rumpf | 3 | 230 | 18.97 |