Generalized Fast Approximate Energy Minimization via Graph Cuts: a-Expansion b-Shrink Moves
Mark Schmidt, Karteek Alahari
We present a-expansion b-shrink moves, a simple generalization of the widely-used ab- swap and a-expansion algorithms for approximate energy minimization. We show that in a certain sense, these moves dominate both ab-swap and a-expansion moves, but unlike previous generalizations the new moves require no additional assumptions and are still solvable in polynomial-time. We show promising experimental results with the new moves, which we believe could be used in any context where a-expansions are currently employed.
PDF Link: /papers/11/p653-schmidt.pdf
AUTHOR = "Mark Schmidt
and Karteek Alahari",
TITLE = "Generalized Fast Approximate Energy Minimization via Graph Cuts: a-Expansion b-Shrink Moves",
BOOKTITLE = "Proceedings of the Twenty-Seventh Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-11)",
PUBLISHER = "AUAI Press",
ADDRESS = "Corvallis, Oregon",
YEAR = "2011",
PAGES = "653--660"