Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...