Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization

Discrete graphical models (also known as discrete Mar-kov random fields) are a major conceptual tool to model the structure of optimization problems in computer vision. While in the last decade research has focused on fast approximative methods, algorithms that provide globally optimal solutions have come more into the research focus in the last years. However, large scale computer vision problems seemed to be out of reach for such methods. In this paper we introduce a promising way to bridge this gap based on partial optimality and structural prop-erties of the underlying problem factorization. Combining these preprocessing steps, we are able to solve grids of size 2048×2048 in less than 90 seconds. On the hitherto unsolv-able Chinese character dataset of Nowozin et al. we obtain provably optimal results in 56 % of the instances and achieve competitive runtimes on other recent benchmark problems. While in the present work only generalized Potts models are considered, an extension to general graphical models seems to be feasible. 1