This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi and Malik, including complete proofs. I also cover briefly the method of ratio cuts, and show how it can be viewed as a special case of normalized cuts. I in...

This paper proposes the framework of branch-and-check with explanations (BCE), a branch-and-cut method where combinatorial cuts are found by general-purpose conflict analysis, rather than by specialized separation algorithms. Specifically, the method features a master problem that ignores combinatorial constraints, and a feasibility subproblem that uses propagation to check the feasibility of t...

This paper describes a new semi-global method for SFS (Shape-from-Shading) using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [I] and the global inethod using energy minimization technique. By employing a new global energy minimization formulatioK the convedconcave ambiguity problcm of the Lee and Rosenfeld method can be resolved efficiently. A new combi...

A short introduction to Integer Programming (IP). Problems leading to IP models. Some modelling tricks and reformulations. Geometry of linear IP. TUM matrices. Brief notes on polyhedral analysis. Separation theory. Chvatal cut hierarchy, Gomory cuts, Disjunctive cuts, RLT cut hierarchy. Iterative methods: Branch-and-Bound, Cutting Plane, Branch-and-Cut, Branch-and-Price. Lower bounds: Lagrangia...

A new method for detecting shot boundaries in video sequences using metrics based on information theory is proposed. The method relies on the mutual information and the joint entropy between frames and can detect cuts, fade-ins and fade-outs. The detection technique was tested on TV video sequences having different types of shots and significant object and camera motion inside the shots. It was...

Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often leads to many segmentation errors and the parameter λ in the energy function is hard to select. In this paper, we propose an iterated graph cuts algorithm, which starts from the sub-graph that comprises the user labeled...

In this paper we propose KDE model for object segmentation on the basis of graph cut and density estimation. In this approach in the initial phase, the saliency map based graph cut is exploited to obtain an initial segmentation result. In the second phase iterative seed adjustment method results further segmentation and then exploits a balancing update scheme of segment refinement. And also it ...

We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color histogram and a distance transform using the segmentation results from graph cuts in the previous process, and set the probability as the t-link of the graph for the next process. The proposed method can segment the ...