University of Cambridge > Talks.cam > Applied and Computational Analysis > Variational Relaxations of the Image Partitioning Problem - Models, Optimization and Optimality

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Online via zoom & Queen Edith Room Teaching Room 1, Old Divinity School, St John’s College Adaptive Resource Allocation for Low-Latency LLM Serving in Dynamic Environments

Other talks

Afternoon Break Title TBC TBC Cambridge RNA Club - IN PERSON Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Discussion I
 

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