Results 1  10
of
10
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1053 (23 self)
 Add to MetaCart
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a generalpurpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.
Graph Based Algorithms for Scene Reconstruction from Two or More Views
, 2004
"... In recent years, graph cuts have emerged as a powerful optimization technique for minimizing energy functions that arise in lowlevel vision problems. Graph cuts avoid the problems of local minima inherent in other approaches (such as gradient descent). The goal of this thesis is to apply graph cuts ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In recent years, graph cuts have emerged as a powerful optimization technique for minimizing energy functions that arise in lowlevel vision problems. Graph cuts avoid the problems of local minima inherent in other approaches (such as gradient descent). The goal of this thesis is to apply graph cuts to a classical computer vision problem — scene reconstruction from multiple views, i.e. computing the 3dimensional shape of the scene. This thesis provides a technical result which greatly facilitates the derivation of the scene reconstruction algorithm. Our result should also be useful for developing other energy minimization algorithms based on graph cuts. Previously such algorithms explicitly constructed graphs where a minimum cut also minimizes the appropriate energy. It is natural to ask for what energy functions we can construct such a graph. We answer this question for the class of functions of binary variables that can be written as a sum of terms containing three or fewer variables. We give a simple criterion for functions in this class which is necessary and sufficient, as well as a necessary condition for any function of binary variables. We also give a
Structural Aspects Of Ordered Polymatroids
, 1997
"... This paper generalizes some aspects of polymatroid theory to partially ordered sets. The investigations are mainly based on Faigle and Kern, Submodular Linear Programs on Forests, Mathematical Programming 72 (1996). A slightly modified concept of submodularity is introduced. As a consequence the mai ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper generalizes some aspects of polymatroid theory to partially ordered sets. The investigations are mainly based on Faigle and Kern, Submodular Linear Programs on Forests, Mathematical Programming 72 (1996). A slightly modified concept of submodularity is introduced. As a consequence the main results do not require any assumptions concerning the underlying partially ordered groundset of the polymatroid. The partial orders are not required to be rooted forests. We consider two different basis concepts for ordered polymatroids. These are Core(f), the set of all elements with maximal cardinality and Max(f), the set of all maximal feasible elements. Both concepts are equivalent for unordered polymatroids. The sets Core(f) and Max(f) are completely described by facetinducing inequalities. Furthermore it is shown by an example that Max(f) is in general not a polyhedral set.
Adaptive Lexicographic Optimization in MultiClass M/GI/1 Queues
 Mathematics of Operations Research
, 1993
"... this paper we take a di#erent approach. While the choice of cost function for a particular system is often ad hoc, it is more natural to associate an average response time objective with each class and consider its performance relative to the objective. Specically, let # # be the response time objec ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
this paper we take a di#erent approach. While the choice of cost function for a particular system is often ad hoc, it is more natural to associate an average response time objective with each class and consider its performance relative to the objective. Specically, let # # be the response time objective and let # denote the longrun average response time (assuming it exists) of class # customers under a scheduling policy #. Attention is restricted to the class # of nonidling, nonpreemptive, and nonanticipative policies; the last term means that scheduling decisions do not depend on future arrival and service times. We are interested in determining a policy in # which lexicographically minimizes the vector of performance ratios ( 1 ## 1 ##### # ## # ) # (1) arranged in nonincreasing order (see Section 2 for the denition.) We will refer to this minimization as lexicographic. Results on optimality crucially hinge on the possibility of characterizing the subset of ## that consists of the vectors of mean response times achievable by policies in #.ThesetA is known to be the base of a polymatroid and is described in Section 2. The lexicographic minimization of vector (1)overthesetA yields a unique point # # := (# # 1 ## 1 ###### # # ## # ) .Suchapointhas certain properties that capture fairness in resource allocation. These are described in remarks following Problem (P) of Section 2. Lexicographic minimization has been studied extensively in a deterministic context [15], [23]. The main contribution of this paper is two simple adaptive policies that (exactly and approximately, respectively) minimize (1) lexicographically. Three quantities are needed in order to specify our policies. Set # 0 =0and denote by # # the end of the #th busy period, # =1# 2##...
Problems of Adaptive Optimization in Multiclass M/GI/1 Queues with Bernoulli Feedback
 Mathematics of Operations Research
, 1992
"... Adaptive algorithms are obtained for the solution of separable optimization problems in multiclass #####1 queues with Bernoulli feedback. Optimality of the algorithms is established by modifying and extending methods of stochastic approximation. These algorithms, can be used as a basis for designing ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Adaptive algorithms are obtained for the solution of separable optimization problems in multiclass #####1 queues with Bernoulli feedback. Optimality of the algorithms is established by modifying and extending methods of stochastic approximation. These algorithms, can be used as a basis for designing policies for semiseparable and approximate lexicographic optimization problems and in the case of #####1 queues without feedback, they also provide a simple policy for lexicographic optimization. The results obtained on stochastic approximation imply convergence of classical recursions such as RobbinsMonroe in cases where the conditional second moment of their increments is not nite.
Maximum Constraint Satisfaction on Diamonds
"... Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or othe ..."
Abstract
 Add to MetaCart
(Show Context)
Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP has been checked for eligibility before being made available. Copies of full items can be used for personal research or study, educational, or notforprofit purposes without prior permission or charge. Provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way. A note on versions: The version presented here is a working paper or preprint that may be later published elsewhere. If a published version is known of, the above WRAP url will contain details on finding it.
Bimonotone linear inequalities and Sublattices Of R n
, 2003
"... A bimonotone linear inequality is a linear inequality with at most two nonzero coefficients that are of opposite signs (if both different from zero). A linear inequality defines a halfspace that is a sublattice of Rn (a subset closed with respect to componentwise maximum and minimum) if and only i ..."
Abstract
 Add to MetaCart
A bimonotone linear inequality is a linear inequality with at most two nonzero coefficients that are of opposite signs (if both different from zero). A linear inequality defines a halfspace that is a sublattice of Rn (a subset closed with respect to componentwise maximum and minimum) if and only if it is bimonotone. Veinott has shown that a polyhedron is a sublattice if and only if it can be defined by a finite system of bimonotone linear inequalities, whereas Topkis has shown that every sublattice of Rn (and of more general product lattices) is the solution set of a system of nonlinear bimonotone inequalities. In this paper we prove that a subset of Rn is the solution set of a countable system of bimonotone linear inequalities if and only if it is a closed convex sublattice. We also present necessary and/or sufficient conditions for a sublattice to be the intersection of the cartesian product of its projections on the coordinate axes with the solution set of a (possibly infinite) system of bimonotone linear inequalities. We provide explicit constructions of such systems of bimonotone linear inequalities under certain assumptions on the sublattice. We obtain Veinottâs polyhedral representation theorem and a 01 version of Birkhoffâs Representation Theorem as corollaries. We also point out a few potential pitfalls regarding properties of sublattices of Rn.
Supermodular Functions and the Complexity of Max CSP
, 2004
"... In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. An instance of Max CSP consists of a set of variables and a collection of constraints which are applied to certain specified subsets of these variables; the goal is to find ..."
Abstract
 Add to MetaCart
In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. An instance of Max CSP consists of a set of variables and a collection of constraints which are applied to certain specified subsets of these variables; the goal is to find values for the variables which maximize the number of simultaneously satisfied constraints. Using the theory of sub and supermodular functions on finite latticeordered sets, we obtain the first examples of general families of efficiently solvable cases of Max CSP for arbitrary finite domains. In addition, we provide the first dichotomy result for a special class of nonBoolean Max CSP, by considering binary constraints given by supermodular functions on a totally ordered set. Finally, we show that the equality constraint over a nonBoolean domain is nonsupermodular, and, when combined with some simple unary constraints, gives rise to cases of Max CSP which are hard even to approximate.