Convex relaxation of a class of vertex penalizing functionals (Q2251199)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex relaxation of a class of vertex penalizing functionals |
scientific article |
Statements
Convex relaxation of a class of vertex penalizing functionals (English)
0 references
11 July 2014
0 references
The authors ``investigate a class of variational problems that incorporate in some sense curvature information of the level lines'' and ``discuss two particular instances: one instance that minimizes the total number of vertices of the level lines and another instance that minimizes the total sum of the absolut exterior angles between the line segments.'' The authors ``show that these problems can be solved approximately by means of a tractable convex relaxation in higher dimensions'' (quotations taken from authors' abstract). Numerical results are also given.
0 references
variational methods
0 references
convex relaxation
0 references
higher order penalties
0 references
roto-translation space
0 references
vertex counting regularization
0 references
total curvature regularization
0 references
binary image segmentation
0 references
image denoising
0 references
image inpainting
0 references
0 references
0 references
0 references
