This paper presents a new algorithm for reducing the minimal surface bias associated with volumetric graph cuts for 3D reconstruction from multiple calibrated images. The algorithm is based on an iterative graph-cut over narrow bands combined with an accurate surface normal estimation. At each iteration, we first optimize the normal to each surface patch in order to obtain a precise value for t...

Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal results efficiently and the convenience of usage are some of the factors of this popularity. However, there are a few issues with graph cuts, such as inherent sequential nature of popular algorithms and the memory bloat in large s...

In this paper, we propose an automatic image annotation approach for region labeling that takes advantage of both context and semantics present in segmented images. The proposed approach is based on multi-class K-nearest neighbor, k-means and particle swarm optimization (PSO) algorithms for feature weighting, in conjunction with normalized cuts-based image segmentation technique. This hybrid ap...

This paper considers a modification of the branch-and-cut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploits the relation between branching disjunctions and intersection cuts. In this work, we focus on di...

Image segmentation based on graph representations has been a very active field of research recently. One major reason is that pairwise similarities (encoded by a graph) are also applicable in general situations where prototypical image descriptors as partitioning cues are no longer adequate. In this context, we recently proposed a novel convex programming approach for segmentation in terms of o...

Split cuts constitute a class of cutting planes that has been successfully employed by the majority of Branch-and-Cut solvers for Mixed Integer Linear Programs. Given a basis of the LP relaxation and a split disjunction, the corresponding split cut can be computed with a closed form expression. In this paper, we use the Lift-and-Project framework [10] to provide the basis, and the Reduce-andSpl...

Given disjoint sets PI, P2 ..... Pd in R a with n points in total, a ham-sandwich cut is a hyperplane that simultaneously bisects the Pi. We present algorithms for finding ham-sandwich cuts in every dimension d > 1. When d = 2, the algorithm is optimal, having complexity O(n). For dimension d > 2, the bound on the running time is proportional to the worst-case time needed for constructing a lev...

Abstract:This paper addresses the short-term scheduling problem for the ethylene cracking process with feedstocks and energy constraints. The cracking production of ethylene is a process with units that have decaying performance, requiring periodic cleanup to restore their performance. Under the condition of limited feedstocks, the production operating mode of the cracking furnaces is to keep y...

In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...