The lazy flipper: efficient depth-limited exhaustive search in discrete graphical models

Authors:
Bjoern Andres;Jörg H. Kappes;Thorsten Beier;Ullrich Köthe;Fred A. Hamprecht
Affiliations:
HCI, University of Heidelberg, Germany;HCI, University of Heidelberg, Germany;HCI, University of Heidelberg, Germany;HCI, University of Heidelberg, Germany;HCI, University of Heidelberg, Germany
Venue:
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Year:
2012

Citing 15
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Finding MAPs for belief networks is NP-hard

Artificial Intelligence
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparison of Algorithms for Inference and Learning in Probabilistic Graphical Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergent Tree-Reweighted Message Passing for Energy Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphical Models, Exponential Families, and Variational Inference

Graphical Models, Exponential Families, and Variational Inference
Exact solution of permuted submodular minsum problems

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning

Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning
MRF Energy Minimization and Beyond via Dual Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence
MAP estimation via agreement on trees: message-passing and linear programming

IEEE Transactions on Information Theory
Decision tree fields

ICCV '11 Proceedings of the 2011 International Conference on Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new exhaustive search algorithm for optimization in discrete graphical models. When pursued to the full search depth (typically intractable), it is guaranteed to converge to a global optimum, passing through a series of monotonously improving local optima that are guaranteed to be optimal within a given and increasing Hamming distance. For a search depth of 1, it specializes to ICM. Between these extremes, a tradeoff between approximation quality and runtime is established. We show this experimentally by improving approximations for the non-submodular models in the MRF benchmark [1] and Decision Tree Fields [2].