Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves
By: Researcher II
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
| Authors | Mark W. Schmidt, Karteek Alahari École Normale Supérieure |
| Journal/Conference Name | UNCERTAINTY IN ARTIFICIAL INTELLIGENCE |
| Paper Category | Computer Science |
| Paper Abstract | We present α-expansion β-shrink moves, a simple generalization of the widely-used αβ-swap and α-expansion algorithms for approximate energy minimization. We show that in a certain sense, these moves dominate both αβ-swap and α-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 α-expansions are currently employed. |
| Date of publication | 2011 |
| Code Programming Language | MATLAB |
| Comment |
Copyright Researcher II 2022