Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch)

Hunter Lang, David A. Sontag, Aravindan Vijayaraghavan

Abstract: We prove that the alpha-expansion algorithm for MAP inference always returns a globally optimal assignment for Markov Random Fields with Potts pairwise potentials, with a catch: the returned assign...