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

               Hunter Lang 1 David Sontag 1 Aravindan Vijayaraghavan 2

            Abstract                computer vision. These algorithms are popular because they
                                are simple and efficient, and they return very high-quality
  We prove that the α-expansion algorithm for MAP
                                solutions in practice (Szeliski et al., 2008; Kappes et al.,
  inference always return ...