BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Variational Relaxations of the Image Partitioning Problem - Models
 \, Optimization and Optimality - Jan Lellmann\, DAMTP
DTSTART:20111201T150000Z
DTEND:20111201T160000Z
UID:TALK34482@talks.cam.ac.uk
CONTACT:Carola-Bibiane Schoenlieb
DESCRIPTION:Variational relaxations can be used to compute approximate min
 imizers of optimal partitioning and multiclass labeling problems on contin
 uous domains. We give an overview about current formulations and their num
 erical solution. We also discuss a recent result on finding integral solut
 ions 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.
LOCATION:MR14\, CMS
END:VEVENT
END:VCALENDAR