We explore the idea of obtaining valid inequalities from a finite-domain formulation of a problem, rather than a 0-1 formulation. A finite-domain model represents discrete choices with variables that have several possible values, as is frequently done in constraint programming. We apply the idea to graph coloring and identify facet-defining cuts that, when converted to cuts in a 0-1 model of th...

We introduce three new cut tree structures of graphs G in which the vertex set of the tree is a partition of V (G) and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently, Kawarabayashi and Thorup [8] presented the first deterministic near-linear edge-connectivity recognition algorithm. A crucial step in this algorithm uses the existen...

Consider a neighborhood graph, for example a k-nearest neighbor graph, that is constructed on sample points drawn according to some density p. Our goal is to re-weight the graph’s edges such that all cuts and volumes behave as if the graph was built on a different sample drawn from an alternative density p. We introduce the f -adjusted graph and prove that it provides the correct cuts and volum...

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...

This paper presents an accurate interactive image segmentation tool using graph cuts and image properties. Graph cuts is a fast algorithm for performing binary segmentation, used to find the global optimum of a cost function based on the region and boundary properties of the image. The user marks certain pixels as background and foreground, and Gaussian mixture models (GMMs) for these classes a...

We propose a novel method to automatically extract the audio-visual objects that are present in a scene. First, the synchrony between related events in audio and video channels is exploited to identify the possible locations of the sound sources. Video regions presenting a high coherence with the soundtrack are automatically labelled as being part of the audio-visual object. Next, a graph cut s...