[2] C. Rother, V. Kolmogorov, A. Blake: ”Grabcut: Interactive Foreground Extraction Using Iterated Graph Cuts”, SIGGRAPH 2004 [3] Y. Boykov, M. P. Jolly: ”Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in n-d Images”, ICCV 2001 Minimize Energy E on 3D grid [3]: E(x) = ∑ i∈V φi(xi) } {{ } Regional Costs + ∑ (i,j)∈E φi,j(xi, xj) } {{ } Boundary Costs Feature Tracking...

This work is partially funded by the German Research Foundation (RO 2497/6-1). [1] Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, TPAMI 2004 [2] Boykov, Y., Jolly, M.: Interactive graph cuts for optimal boundary & region segmentation of objects in nd images, ICCV 2001 [3] Rother, C., Kolmogorov, V., Blake, A.: Grabcut: In...

The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008). In this work, we s...

We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied either symbolically during a branch-and-bound search or as constraints in the MILP model. Furthermore, they represent a new class ...

We present a new method for solving stochastic programs with joint chance constraints with random technology matrices and discretely distributed random data. The problem can be reformulated as a large-scale mixed 0-1 integer program. We derive a new class of optimality cuts called IIS cuts and apply them to our problem. The cuts are based on irreducibly infeasible subsets (IIS) of an LP defined...

Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. However, a hierarchical clustering algorithm by Flake et al., which is based on minimum s-t-cuts whose sink sides are of minimum size, yields such a provable guarantee. We introduce a new degree of freedom to this method by allowing arbitrary minimum s-t-cuts and show that this unr...

We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment score through calculation of corresponding likelihoods. The size error model is derived through the application of Central Limit Theorem and validated by residual plots collected from real data. Missing cuts and false...

The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008). In this work, we s...

In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...