1-2008 Graph Cuts via l 1 Norm Minimization

@inproceedings{Bhusnurmath201412008GC,
  title={1-2008 Graph Cuts via l 1 Norm Minimization},
  author={Arvind Bhusnurmath},
  year={2014}
}
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 l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between graph cuts and other related continuous optimization problems. Eventually, the problem is reduced to solving a sequence of sparse linear systems… CONTINUE READING