Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves

Abstract

We present alpha-expansion beta-shrink moves, a simple generalization of the widely-used alpha-beta swap and alpha-expansion algorithms for approximate energy minimization. We show that in a certain sense, these moves dominate both alpha-beta-swap and alpha-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 alpha-expansions are currently employed.
Fichier principal
Vignette du fichier
sample2e.pdf (194.54 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00617524 , version 1 (29-08-2011)

Identifiers

  • HAL Id : inria-00617524 , version 1
  • ARXIV : 1108.5710

Cite

Mark Schmidt, Karteek Alahari. Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves. UAI 2011 - 27th Conference on Uncertainty in Artificial Intelligence, Jul 2011, Barcelona, Spain. ⟨inria-00617524⟩
407 View
1654 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More