A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...