Aug 29, 2011 · We present alpha-expansion beta-shrink moves, a simple generalization of the widely-used alpha-beta swap and alpha-expansion algorithms for approximate energy ...
Missing: b- | Show results with:b-
Aug 29, 2011 · We present α-expansion β-shrink moves, a simple generalization of the widely-used αβ- swap and α-expansion algorithms for approx-.
It is shown that in a certain sense, these moves dominate both αβ-swap and α-expansion moves, but unlike previous generalizations the new moves require no ...
Jul 14, 2011 · We present α-expansion β-shrink moves, a simple generalization of the widely-used αβ-swap and α-expansion algorithms for approximate energy ...
We present two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap ...
Missing: Shrink | Show results with:Shrink
We present two algo- rithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap ...
Missing: Shrink | Show results with:Shrink
Our expansion move algorithm requires the smoothness term to be a metric. It generates a labeling such that there is no expansion move that decreases the energy ...
Missing: Shrink | Show results with:Shrink
We show promising experimental results with the new moves, which we believe could be used in any context where alpha-expansions are currently employed.
Missing: b- | Show results with:b-
Our sec- ond algorithm, which requires the smoothness term to be a metric, generates a labeling such that there is no expansion move that decreases the energy.
Missing: Shrink | Show results with:Shrink
Aug 29, 2011 · Generalized Fast Approximate Energy Minimization via Graph Cuts: α-Expansion β-Shrink Moves. Mark Schmidt. INRIA - SIERRA Team∗. Laboratoire d ...