A Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems

• Published in: 2013 IEEE Conference on Computer Vision and Pattern Recognition pp. 1328 - 1335
• Main Authors: Kappes, Jorg H., Andres, Bjoern, Hamprecht, Fred A., Schnorr, Christoph, Nowozin, Sebastian, Batra, Dhruv, Sungwoong Kim, Kausler, Bernhard X., Lellmann, Jan, Komodakis, Nikos, Rother, Carsten
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2013
• Subjects: benchmark; Benchmark testing; Computational modeling; Computer vision; discrete optimization; graphical models; Markov random fields; Message passing; Minimization; Optimization; Runtime
• ISSN: 1063-6919
• DOI: 10.1109/CVPR.2013.175

Even years ago, Szeliski et al. published an influential study on energy minimization methods for Markov random fields (MRF). This study provided valuable insights in choosing the best optimization technique for certain classes of problems. While these insights remain generally useful today, the phenominal success of random field models means that the kinds of inference problems we solve have changed significantly. Specifically, the models today often include higher order interactions, flexible connectivity structures, large label-spaces of different cardinalities, or learned energy tables. To reflect these changes, we provide a modernized and enlarged study. We present an empirical comparison of 24 state-of-art techniques on a corpus of 2,300 energy minimization instances from 20 diverse computer vision applications. To ensure reproducibility, we evaluate all methods in the OpenGM2 framework and report extensive results regarding runtime and solution quality. Key insights from our study agree with the results of Szeliski et al. for the types of models they studied. However, on new and challenging types of models our findings disagree and suggest that polyhedral methods and integer programming solvers are competitive in terms of runtime and solution quality over a large range of model types.