Convex Optimization for Computer Vision

Professor Daniel Cremers
Professor, Tehnical University, Munich
Given on: February 21, 2013


A multitude of computer vision challenges can be cast as problems of energy minimization. One of the major scientific challenges lies in efficiently computing solutions of minimal energy. I will introduce optimization methods which address problems such as multiple view reconstruction, image segmentation or 3D shape matching by means of convex relaxation methods. In contrast to most existing energy minimization methods, the proposed algorithms do not require an initialization and allow to compute robust solutions with guaranteed optimality properties.


Daniel Cremers received Bachelor degrees in Mathematics (1994) and Physics (1994), and a Master's degree in Theoretical Physics (1997) from the University of Heidelberg. In 2002 he obtained a PhD in Computer Science from the University of Mannheim, Germany. Subsequently he spent two years as a postdoctoral researcher at the University of California at Los Angeles (UCLA) and one year as a permanent researcher at Siemens Corporate Research in Princeton, NJ. From 2005 until 2009 he was associate professor at the University of Bonn, Germany. Since 2009 he holds the chair for Computer Vision and Pattern Recognition at the Technical University, Munich. His publications received several awards, including the award of Best Paper of the Year 2003 by the Int. Pattern Recognition Society and the 2005 UCLA Chancellor's Award for Postdoctoral Research. In December 2010 the magazine Capital listed Prof. Cremers among “Germany's Top 40 Researchers Below 40”.