Convex non-convex image segmentation (Q2413469)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6857782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex non-convex image segmentation |
scientific article; zbMATH DE number 6857782 |
Statements
Convex non-convex image segmentation (English)
0 references
10 April 2018
0 references
The paper considers the variational model for multiphase segmentation of images in which the minimized energy functional consists of a standard strictly convex quadratic fidelity term and a non-convex regularization term designed for penalizing simultaneously the non-smoothness of the inner segmented regions and the length of the boundaries. Sufficient conditions for convexity are derived for the model. An iterative minimization procedure based on the alternating direction method of multipliers is proposed. The convergence of the algorithm is established. The performance of the procedure is demonstrated by three numerical examples.
0 references
image segmentation
0 references
convex regularization
0 references
penalty function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9276726
0 references
0.90267724
0 references
0.89692223
0 references
0.89350057
0 references
0.89340895
0 references
0.8904165
0 references
0.8879571
0 references
