MATHEMATICS AND COMPUTER SCIENCE

Kolmogorov Group

Discrete Optimization

When we step out into the street, we automatically judge the distance and speed of cars. For computers, estimating the depth of objects in an image requires complex computations. A popular approach for tackling this problem is to use discrete optimization algorithms – the research focus of the Kolmogorov group.

The work of Vladimir Kolmogorov’s group can be divided into three topics. The first is the development of efficient algorithms for inference in graphical models and combinatorial optimization problems. Some of their techniques are widely used in computer vision and other areas, for example the “Boykov-Kolmogorov” maximum flow algorithm and the “TRW-S” algorithm for MAP inference in pairwise graphical models. Kolmogorov‘s “Blossom V” algorithm is currently the fastest technique in practice for computing a minimum cost perfect matching in a graph. Their second focus is theoretical investigations of the complexity of discrete optimization, in particular using the framework of valued constraint satisfaction problems and their variants. Finally, the Kolmogorov group has worked on applications of discrete optimization in computer vision, such as image segmentation and stereo reconstruction.

Group Leader


On this site:


Team


Current Projects

Inference in graphical models | Combinatorial optimization problems | Theory of discrete optimization


Publications

Kazda A, Kolmogorov V, Rolinek M. 2019. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2). View

Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056. View

Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304. View

Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682. View

Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65. View

View All Publications

Career

since 2014 Professor, IST Austria
2011 – 2014 Assistant Professor, IST Austria
2005 – 2011 Lecturer, University College London, UK
2003 – 2005 Assistant Researcher, Microsoft Research, Cambridge, UK
2003 PhD, Cornell University, Ithaca, U


Selected Distinctions

2018 Best paper award honorable mention at IEEE/CVF Conference on Computer Vision and Pattern Recognition
2013 ERC Consolidator Grant
2012 Koenderink Prize at the European Conference on Computer Vision for fundamental contributions to computer vision
2007 Honorable mention, outstanding student paper award (to M. Pawan Kumar) at Neural Information Processing Systems Conference
2006 – 2011 Royal Academy of Engineering/EPSRC Research Fellowship
2005 Best paper honorable mention award at IEEE Conference on Computer Vision and Pattern Recognition
2002 Best paper award at the European Conference on Computer Vision


Additional Information

Open Kolmogorov’s homepage



Back to Top