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 ...
Aug 29, 2011 · In this paper we propose a new type of move, α-expansion β-shrink moves (§4). These move are a simple gen- eralization of both αβ-swap and α- ...
We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is an α-β- swap: for ...
Missing: Shrink | Show results with:Shrink
We present α-expansion β-shrink moves, a simple generalization of the widely-used αβ-swap and α-expansion algorithms for approximate energy minimization. We ...
We present alpha-expansion beta-shrink moves, a simple generalization of the widely-used alpha-beta swap and alpha-expansion algorithms for approximate ...
Jul 14, 2011 · We present α-expansion β-shrink moves, a simple generalization of the widely-used αβ-swap and α-expansion algorithms for approximate energy ...
We show promising experimental results with the new moves, which we believe could be used in any context where alpha-expansions are currently employed.
One move we consider is an α-expansion: for a label α, this move assigns an arbitrary set of pixels the label α. Our expansion move algorithm requires the ...
Missing: Shrink | Show results with:Shrink
Our expansion algorithm finds a labeling within a known factor of the global minimum, while our swap algorithm handles more general energy functions. Both ...
Missing: Shrink | Show results with:Shrink
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 ...