Variational Methods in Computer Vision

Tutorial ECCV 2010

Daniel Cremers, Bastian Goldlücke, Thomas Pock

Content

Basic concepts of variational methods: variational approach, Euler-Lagrange equations, duality, …
Foundations of convex optimization and convex relaxation techniques
Optimal first-order algorithms for convex optimization
Variational formulations for classical computer vision problems: image segmentation, optical flow, stereo and multiview reconstruction, …
Relations to discrete optimization and Markov random fields
Mumford-Shah and multilabel problems

Sunday, 5.9.2010

9:00	Mathematical Foundations	Bastian Goldlücke
10:40	Coffee break
11:00	Continuous Optimization in Computer Vision	Thomas Pock
13:00	Lunch break
14:00	Variational Methods and Geometric Reconstruction	Daniel Cremers
15:40	Coffee break
16:00	The Mumford-Shah Problem in Computer Vision	Thomas Pock
17:00	Vectorial Total Variation and Multilabel Problems	Bastian Goldlücke