Learn More
Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l<sub>1</sub> norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between(More)
  • 1