This is an old revision of the document!
Computer Vision I: Variational Methods
WS 2019/20, TU München
News
29.10.19:
- The lecture on Tuesday, 12.11.19 is canceled to to the SVV assembly.
Lecture
Location: Interims Hörsaal 2 (5620.01.102)
Time and Date:
Tuesday, 10.15h - 11.45h
Thursday, 10.15h - 11.00h
Lecturer: Prof. Dr. Daniel Cremers
The lectures are held in English.
Exercises
Location: Interims II (at the chemistry building): 004, Hörsaal 1 (5416.01.004)
Time and Date: Wednesday, 10.30h - 12.30h
Organization: Marvin Eisenberger and Emanuel Laude
Contact: cvvm-ws19@vision.in.tum.de
Exam
tba.
Summary
Variational Methods are among the most classical techniques for optimization of cost functions in higher dimension. Many challenges in Computer Vision and in other domains of research can be formulated as variational methods. Examples include denoising, deblurring, image segmentation, tracking, optical flow estimation, depth estimation from stereo images or 3D reconstruction from multiple views.
In this class, I will introduce the basic concepts of variational methods, the Euler-Lagrange calculus and partial differential equations. I will discuss how respective computer vision and image analysis challenges can be cast as variational problems and how they can be efficiently solved. Towards the end of the class, I will discuss convex formulations and convex relaxations which allow to compute optimal or near-optimal solutions in the variational setting.
Prerequisites
The requirements for the class are knowledge in basic mathematics, in particular multivariate analysis and linear algebra. Some prior knowledge on optimization is a plus but is not necessary.
Lecture Material
Slides and exercise sheets can be accessed here.
Videos
A previous (very similar) version of this course was recorded in 2013. The videos can be found on Youtube.