University of Cambridge > Talks.cam > Applied and Computational Analysis > Convex relaxation of a class of vertex penalizing functionals

Convex relaxation of a class of vertex penalizing functionals

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

We investigate a class of variational problems that incorporate in some sense curvature information of the level lines. The functionals we consider incorporate metrics defined on the orientations of pairs of line segments that meet in the vertices of the level lines. We 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 absolute exterior angles between the line segments. In case of smooth level lines, the latter corresponds to the total absolute curvature. We show that these problems can be solved approximately by means of a tractable convex relaxation in higher dimensions. In our numerical experiments we present preliminary results for image segmentation, image denoising and image inpainting. (Joint work with Kristian Bredies, University Graz, and Benedikt Wirth, University of M√ľnster)

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2023 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity