Optimisation for Visual Computing

Summer Term 2013

Hauptseminar: Optimisation for Visual Computing

Oliver Demetz, Dr. Simon Setzer

Summer Term 2013

Seminar (2 h)

Notice for bachelor/master students of mathematics: This is a »Hauptseminar« in the sense of these study programs.

Source: Valgaerts et al.

NewsImportant DatesDescriptionRegistrationRequirementsOverview of Topics Literature

  • 16.04.2013:
    Our first regular meeting will take place on Wednesday, May, 8th 2013, as planned.

  • 03.04.2013:
    Our Room has changed. Our regular meetings will take place in Room 008, building E1.7.

  • 06.02.2013:
    The list of assigned topic is updated. Please make sure that your assigned topic is right.

  • Our mandatory introductory meeting is scheduled for Wednesday, February 6, 2013, 16:15h, Building E1.7, Room SR 001
    In this meeting, we will assign the topics to the participants. Attendance is mandatory for all participants.

Introductory meeting (mandatory):
Wednesday, February 6, 2013, 16:15h, Building E1.7, Room SR 001
In this meeting, we will assign the topics to the participants. Your attendance is mandatory.

The registration period was
from Thursday, January 31, 2013, 13:00h
to Wednesday, February 6, 2013, 12:00h.

We will have 7 regular meetings during the summer term 2013:
Wednesdays, 16:15h, Building E1.7, SR 008

Date of first regular meeting: Wednesday, May 8th, 2013

Contents: To make a long story short, Optimisation is omnipresent: Everywhere - in our everyday life, in nature, as well as in science - optimisation is a central part of everything. The same holds of course for visual computing, and thus this course focusses on the various, wide spread appearances of optimisation in our field. Instead of trying to cover the complete spectrum of optimisation strategies, we will pick out a few selected concepts that are of major interest for image and signal processing. In detail, we will try to hold the balance between practical use cases and "classical", more theoretical optimisation concepts. We will consider several chapters of the excellent and free book by Boyd and Vandenberghe and back these theoretical talks up by practial applications. However, even for the theoretical topics, the connection to actual image processing applications should never be lost by the participants.

Prerequisites: The seminar is for advanced bachelor or master students in Visual Computing, Mathematics or Computer Science. Basic mathematical knowledge (e.g. Mathematik für Informatiker I-III) is required, and some knowledge in image analysis is recommended.

Language: All papers are written in English, and English is the preferred language of presentation.

The registration period is over.

Notice that registration was only possible
from Thursday, January 31, 2013, 13:00h
to Wednesday, February 6, 2013, 12:00h.

Since the number of talks is limited, we ask for your understanding that participants are considered strictly in the order of registration – no exceptions.

Regular attendance: You must attend all seminar meetings, except for provable important reasons (medical certificate).

Talk: Talk duration is 30 min, plus 15 min for discussion. Please do not deviate from this time schedule.
You may give a presentation using a data projector («beamer«), overhead projector or blackboard, or mix these media appropriately. Your presentation should be delivered in English. Your slides and your write-up, too, should be in English.

Write-up: The write-up has to be handed until Friday, August 9th 12:00h pm (midday). The write-up should summarise your talk, about 5 pages per speaker will be adequate in most cases. Electronic submission is preferred. File format for electronic submissions is PDF – text processor files (like .doc) are not acceptable. Adhere to the standards of scientific referencing: Quotations and copied material (such as images) must be clearly marked as such, and a bibliography is required. Do not forget to hand in your writeup, because participants that do not submit a writeup cannot obtain the certificate for the seminar!

Mandatory consultation: Talk preparation has to be presented to your seminar supervisor no later than one week before the talk is given. It is your responsibility to approach us timely and make your appointment!

No-shows: In case you do not appear to your scheduled talk, we reserve the right to exclude you from all future seminars of our group.

Participation in discussions: The discussions after the presentations are a vital part of this seminar. This means that the audience (i.e. all paricipants) poses questions and tries to find positive and negative aspects of the proposed idea. This participation is part of your final grade.

Being in time: To avoid disturbing or interrupting the speaker, all participants have to be in the seminar room in time. Participants that turn out to be regularly late must expect a negative influence on their grade.

We plan to discuss the following papers. If your registration was successful, the password will be sent to you before the first meeting.

No.   Date   Speaker Topic
1 8.5.13 Thomas Schmeyer Norm approximation (Boyd Ch. 6.1 6.2)
2 8.5.13 Alexander Scheer Unconstrained Minimisation (Boyd Ch. 9)
3 15.5.13 Stephanie Jennewein Karush Kuhn Tucker Conditions (Boyd Ch. 5)
4 15.5.13 Hamidreza Heydarian Fundamental Matrix Estimation (Valgaerts et al.)
5 22.5.13 Arnur Nigmetov Primal Dual Hybrid Gradient (Zhu and Chan)
6 22.5.13 Timo Adam Graduated Non-Convexity (Blake and Zisserman)
7 29.5.13 Hosnieh Sattar Gradient Descent: Optic flow (Alvarez et al.)
8 29.5.13 Banafsheh Sadry Simulated Annealing (Černý)
9 5.6.13 Özgün Cicek Ramdomised Methods (Mainberger et al.)
10 5.6.13 Kelvin Chelli Euler Lagrange
11 12.6.13 Venu Babu Thati Graph Cuts (Boykov et al.)
12 12.6.13 Hui Men Multi-label Moves for MRFs with Truncated Convex Priors (O. Veksler)
13 19.6.13 Jianxing Chen Simulating Classic Mosaics with Graph Cuts (Liu et al.)
14 19.6.13 Laura Dörr Belief Propagation (Felzenszwalb and Huttenlocher)

After the registration period has ended, we will make the related work accessible with usename and password for the participants.

  • S. Boyd and L. Vandenberghe, Convex Optimisation, Cambridge University Press, 2004.
  • L. Valgaerts, A. Bruhn, M. Mainberger, J. Weickert:
    Dense versus sparse approaches for estimating the fundamental matrix.
    International Journal of Computer Vision, Vol. 96, No. 2, 212-234, Jan. 2012.
    Revised version of Technical Report No. 263, Department of Mathematics, Saarland University, Saarbrücken, Germany, October 2010.
  • A. Blake and A. Zisserman, Visual Reconstruction, MIT Press 1987.
  • L. Alvarez, J. Weickert, J. Sánchez:
    A scale-space approach to nonlocal optical flow calculations,
    In M. Nielsen, P. Johansen, O. F. Olsen, J. Weickert (Eds.): Scale-Space Theories in Computer Vision. Lecture Notes in Computer Science, Vol. 1682, 235-246, Springer, Berlin, 1999.
  • M. Mainberger, S. Hoffmann, J. Weickert, C. H. Tang, D. Johannsen, F. Neumann, B. Doerr:
    Optimising spatial and tonal data for homogeneous diffusion inpainting.
    In A. M. Bruckstein, B. ter Haar Romeny, A. M. Bronstein, M. M. Bronstein (Eds.): Scale Space and Variational Methods in Computer Vision. Lecture Notes in Computer Science, Vol. 6667, 26-37, Springer, Berlin, 2012.
  • Yuri Boykov, Olga Veksler, Ramin Zabih, Fast Approximate Energy Minimization via Graph Cuts. In IEEE transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 23, no. 11, pp. 1222-1239, 2001.
  • Yuri Boykov, Vladimir Kolmogorov, An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. In IEEE transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
  • P. Felzenszwalb and D. Huttenlocher, Efficient Belief Propagation for Early Vision, IEEE CVPR, Vol 1, pp. 261-268, 2004.
  • V. Černý, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications January 1985, Volume 45, Issue 1, pp 41-51
  • M. Zhu and T. Chan, An Effcient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration.UCLA CAM Report, 2008.
  • Multi-label Moves for MRFs with Truncated Convex Priors. O. Veksler, International Journal of Computer Vision, vol. 98, no. 1, 1-14, 2012.
  • Simulating Classic Mosaics with Graph Cuts. Y. Liu, O. Veksler, O. Juan, Computer Graphics Forum (CGF) , vol. 29, issue 8, pp. 2387-2399 (2010).

MIA Group
The author is not
responsible for
the content of
external pages.

Imprint - Data protection