Variational Relaxations of the Image Partitioning Problem - Models, Optimization and Optimality

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

• Jan Lellmann, DAMTP
• Thursday 01 December 2011, 15:00-16:00
• MR14, CMS.

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

Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. We give an overview about current formulations and their numerical solution. We also discuss a recent result on finding integral solutions with an a priori upper bound on the objective by solving the relaxed problem. We show that the approach can be interpreted as an approximate, multiclass variant of the coarea formula.

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

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• Interested Talks
• MR14, CMS
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.