Basics on the Graphcut Algorithm. Application for the Computation of the Mode of the Ising Model
|
|
- Laura Arnold
- 6 years ago
- Views:
Transcription
1 Basics on the Graphcut Algorithm. Application for the Computation of the Mode of the Ising Model Bruno Galerne MAP5, Université Paris Descartes Master MVA Cours Méthodes stochastiques pour l analyse d images Lundi 13 mars 2017
2 Outline The Max-Flow Min-Cut Theorem Computation of the Mode of the Ising Model
3 Reference The main reference for this course is Exercise 2 of Chap. 4 of the book Pattern Theory: The Stochastic Analysis of Real-World Signals by D. Mumford and A. Desolneux [Mumford and Desolneux 2010] Graph illustrations and proof of Max-flow min-cut theorem from [Cormen et al., 2009]. Original research paper for applying graphcut to the Ising model [Greig et al., 1989]
4 Outline The Max-Flow Min-Cut Theorem Computation of the Mode of the Ising Model
5 Directed Graphs We consider an arbitrary finite directed graph (V, E) with vertices V and directed edges E V V, with no self-loop. The vertices will be denoted u, v, V. The directed edges will be denoted uv E or (u, v) E. The graph (V, E) is given with a capacity function c : E [0, + ). For each edge (u, v) E, c(u, v) is the maximal amount of current allowed to go from u to v. Two special vertices: the vertex s (the source) and the vertex t (the sink). We call a flow network the 5-uplet G = (V, E, c, s, t).
6 Flows in a flow network For a vertex u V define the two sets of vertices Γ + (u) = {v, uv E} and Γ (u) = {v, vu E}. Definition (Flow) A flow f is a function f : E R that satisfies the two following properties: Capacity constraint: For all (u, v) E, 0 f (u, v) c(u, v). Flow conservation: For all u V \ {s, t}, f (u, v) = f (v, u). v Γ + (u) v Γ (u)
7 Flows in a flow network Definition (Value of a flow) The value f of a flow is the net amount of flow getting out of the source f = f (s, v) f (v, s). v Γ + (s) v Γ (s) f is also the amount of flow getting out through the sink t... f is also the amount of flow going through the partition of the vertices f = 19 = etc. (proof in a couple of slides)
8 Max-flow problem Since f f is continuous (it is a linear map) and the set of flow is compact (it is a compact polytope), there exists flows f having maximal flow value f. Max-flow problem: Given a a network flow G, determine a flow f that reaches the maximal flow value f associated with the network.
9 Cut of Flow Networks Definition (Cut) A cut (S, T ) of flow network G = (V, E) is a partition of V into S and T = V \ S such that s S and t T. The capacity of the cut (S, T ) is the total amount of current that can pass from S to T : c(s, T ) = c(u, v). (u,v) S T E If f is a flow, the net flow across the cut (S, T ) is defined as f (u, v) f (v, u). (u,v) S T E (v,u) T S E S = {s, v 1, v 2 }, T = {t, v 3, v 4 } c(s, T ) = = 26 Net flow across (S, T ) is = 19 f = 19...
10 Cut and Flows Proposition (The capacity of a cut bounds the value of a flow) Let (S, T ) be any cut and f be any flow. Then, (a) The net flow across the cut (S, T ) is equal to the flow value f : f (u, v) f (v, u) = f. (u,v) S T E (v,u) T S E (b) The capacity of the cut (S, T ) is larger than the flow value f : f c(s, T ) = c(u, v). (u,v) S T E
11 Cut and Flows: Proof I Proof of (a) : The net flow across the cut (S, T ) is equal to the flow value f : f (u, v) f (v, u) = f. (u,v) S T E (v,u) T S E Using the flow conservation at each u S \ {s}, f = f (s, v) f (v, s) + v Γ + (s) v Γ (s) = f (u, v) u S v Γ + (u) = f (u, v) (u,v) S T E v Γ (u) (v,u) T S E u S\{s} f (v, u) f (v, u) v Γ + (u) f (u, v) v Γ (u) f (v, u) } {{ } =0
12 Cut and Flows: Proof II Proof of (b) : The capacity of the cut (S, T ) is larger than the flow value f : f c(s, T ) = c(u, v). (u,v) S T E Recall that by definition the flow is bounded by the capacity: From (a), For all (u, v) E, f = (u,v) S T E (u,v) S T E 0 f (u, v) c(u, v). f (u, v) }{{} c(u,v) (v,u) T S E c(u, v) = c(s, T ). f (v, u) }{{} 0
13 Min-Cut Problem Max-flow problem: Given a a network flow G, determine a cut (S, T ) such that the cut capacity c(s, T ) reaches the minimal value among all cuts. Remarks: This is a partition problem that is a priori combinatorial: Find the minimum value among the 2 V 2 possible cuts. But this can be solved in polynomial time!
14 The Max-Flow Min-Cut Theorem Theorem (The Max-Flow Min-Cut Theorem) The maximal flow value from s to t is equal to the minimum of the capacities of cuts separating s from t: max f = min c(s, T ). flow f cut (S,T ) Remarks: The max-flow and min-cut problems can be interpreted as two primal-dual linear programs. The theorem then boils down to a consequence of the strong duality theorem. We will give a more constructive proof that leads to an algorithm: 1. Construct iteratively a maximal flow f. 2. Given a maximal flow f, construct a cut (S, T ) such that c(s, T ) = f. Each step of this algorithm relies on the concept of residual network associated with a flow f...
15 Residual Network Associated with a Flow Definition (Residual network associated with a flow f ) Let f be a flow. The residual capacity c f : V V [0, + ) associated with f is defined by c f (u, v) = max(c(u, v) f (u, v), f (v, u)). (with the convention c(u, v) = 0 if (u, v) / E). The set of residual edges is E f = {(u, v) V V, c f (u, v) > 0}. The residual network associated with f is G f = (V, E f, c f, s, t). Intuitively, the residual network associated with the flow f is made of all edges (u, v) such that the flow can be increased from u to v or decreased from v to u. Recall that we always have f c(s, T ). To have equality one needs that for each boundary edge (u, v) with u S and v T, f (u, v) = c(u, v) and f (v, u) = 0, that is, c f (u, v) = 0.
16 Residual Network Associated with a Flow Network G with flow f with value f = 19. Residual network G f. Augmenting path with residual capacity 4. New flow with value f + 4 = 23
17 Residual Network and Augmenting Path Definition Let f be a flow. We call augmenting path any simple path p = (s = v 1, v 2,..., v k = t) from the source s to the sink t in the residual graph G f. The residual capacity of an augmenting path p is the minimal residual capacity along p, that is, c f (p) = min{c f (v i, v i+1 ), 1 i k 1}. Proposition Let p = (s = v 1, v 2,..., v k = t) be an augmenting path. Define g as follows: For all edges (u, v) / p, g(u, v) = f (u, v) and for all edges (u, v) p, { f (u, v) = f (u, v) + c f (p) if c(u, v) f (u, v) > f (v, u), otherwise, { f (u, v) = f (u, v) f (v, u) = f (v, u) c f (p) f (v, u) = f (v, u) Then g is a flow of G with value g = f + c f (p) > f. Proof: g is a flow (respect capacity and conservation constraint), and the net value at s is +c f (p).
18 The Max-Flow Min-Cut Theorem Theorem (The Max-Flow Min-Cut Theorem) The maximal flow value from s to t is equal to the minimum of the capacities of cuts separating s from t: max f = min c(s, T ). flow f cut (S,T ) More precisely, if f is a flow, then the following conditions are equivalent: (a) f is a maximum flow in G. (b) The residual network G f contains no augmenting paths. (c) The flow of f is equal to the capacity of a cut: f = c(s, T ) for some cut (S, T ).
19 Proof of The Max-Flow Min-Cut Theorem Theorem (The Max-Flow Min-Cut Theorem) The maximal flow value from s to t is equal to the minimum of the capacities of cuts separating s from t: max f = min c(s, T ). flow f cut (S,T ) More precisely, if f is a flow, then the following conditions are equivalent: (a) f is a maximum flow in G. (b) The residual network G f contains no augmenting paths. (c) The flow of f is equal to the capacity of a cut: f = c(s, T ) for some cut (S, T ). Proof of (c) (a): We know that for any cut (S, T ) and any flow f, f c(s, T ). Hence, if there exists (S, T ) such that f = c(s, T ), then the flow value is necessary maximal. Proof of (a) (b): This is the contrapositive of the previous proposition: if the residual network contains an augmenting path with capacity c f (p), then we can augment f into a flow with value f + c f (p), and thus f is not maximal.
20 Proof of The Max-Flow Min-Cut Theorem Theorem (The Max-Flow Min-Cut Theorem) The maximal flow value from s to t is equal to the minimum of the capacities of cuts separating s from t: max f = min c(s, T ). flow f cut (S,T ) More precisely, if f is a flow, then the following conditions are equivalent: (a) f is a maximum flow in G. (b) The residual network G f contains no augmenting paths. (c) The flow of f is equal to the capacity of a cut: f = c(s, T ) for some cut (S, T ). Proof of (c) (a): We know that for any cut (S, T ) and any flow f, f c(s, T ). Hence, if there exists (S, T ) such that f = c(s, T ), then the flow value is necessary maximal. Proof of (a) (b): This is the contrapositive of the previous proposition: if the residual network contains an augmenting path with capacity c f (p), then we can augment f into a flow with value f + c f (p), and thus f is not maximal.
21 Proof of The Max-Flow Min-Cut Theorem Theorem (The Max-Flow Min-Cut Theorem) The maximal flow value from s to t is equal to the minimum of the capacities of cuts separating s from t: max f = min c(s, T ). flow f cut (S,T ) More precisely, if f is a flow, then the following conditions are equivalent: (a) f is a maximum flow in G. (b) The residual network G f contains no augmenting paths. (c) The flow of f is equal to the capacity of a cut: f = c(s, T ) for some cut (S, T ). Proof of (c) (a): We know that for any cut (S, T ) and any flow f, f c(s, T ). Hence, if there exists (S, T ) such that f = c(s, T ), then the flow value is necessary maximal. Proof of (a) (b): This is the contrapositive of the previous proposition: if the residual network contains an augmenting path with capacity c f (p), then we can augment f into a flow with value f + c f (p), and thus f is not maximal.
22 Proof of The Max-Flow Min-Cut Theorem Proof of (b) (c): Suppose that G f contains no augmenting paths, that is, no path from s to t. Then define S = {v V, there exists a path from s to v in G f } and T = V \ S. Remark that s S and t T (since by hypothesis t / S), and thus (S, T ) is a cut. Now consider a pair of vertices u S and v T. By construction, u and v are not connected in G f and thus c f (u, v) = 0, that is, f (u, v) = c(u, v) and f (v, u) = 0. Hence, f = f (u, v) f (v, u) = (u,v) S T E (u,v) S T E = c(s, T ). c(u, v) 0 (v,u) T S E The flow of f is equal to the capacity of the cut (S, T ). Note that the construction of the cut (S, T ) is explicit.
23 Algorithm for Min-Cut Computation 1. Compute a max-flow f with the following iterative algorithm: Initialize the flow f with zero While there exists an augmenting path p in the residual network Gf : Augment the flow f along p. 2. Given the max-flow f, compute the cut (S, T ) defined by S = {v V, there exists a path from s to v in G f } and T = V \ S. Remarks: The iterative procedure of 1. is called the Ford-Fulkerson method. The convergence is not guaranteed. One should chose the augmenting path p among the shortest paths linking s and t. This is then called the Edmonds-Karp algorithm [Cormen et al., 2009]. It then converges in O( V E 2 ) times [Cormen et al., 2009].
24 Outline The Max-Flow Min-Cut Theorem Computation of the Mode of the Ising Model
25 The Ising Model Notation: Ω M,N = {0,..., M 1} {0,..., N 1} is the set of pixel indexes. For keeping the notation short we will denote by α or β pixel coordinates (k, l), (m, n), so that I(α) = I(k, l) for some (k, l). We note α β to mean that pixels α and β are neighbors for the 4-connectivity (each pixel has 4 neighbors, except at the border). Energy: To each couple of images (I, J), I R M N, J { 1, 1} M N, one associates the energy E(I, J) defined by E(I, J) = c (I(α) J(α)) 2 + (J(α) J(β)) 2 α Ω M,N α β where c > 0 is a positive constant and the sum α β means that each pair of connected pixels is summed once (and not twice). The first term of the energy measures the similarity between I and J. The second term measures the similarity between pixels of J that are neighbors.
26 The Ising Model Energy: E(I, J) = c (I(α) J(α)) 2 + (J(α) J(β)) 2 α Ω M,N α β The Ising model associated with I: For any fixed image I, this energy enables to define a discrete probability distribution on { 1, 1} M N by p T (J) = 1 Z T e 1 T E(I,J), where T > 0 is a constant called the temperature and Z T is the normalizing constant Z T = e 1 T E(I,J). J { 1,1} M N The probability distribution p T is the Ising model associated with I (and constant c and temperature T ).
27 The Ising Model Energy: E(I, J) = c (I(α) J(α)) 2 + (J(α) J(β)) 2 α Ω M,N α β Probability distribution: p T (J) = 1 Z T e 1 T E(I,J) Minimizing with respect to J the energy E(I, J) is equivalent to find the most probable state of the discrete distribution p T. Note that this most probable state (also called the mode of the distribution) is the same for all temperatures T. As T tends to 0, the distribution p T tends to be concentrated at this mode. As T tends to +, p T tends to be uniform over all the possible image configurations. Hence the temperature parameter T controls the amount of allowed randomness around the most probable state.
28 The Ising Model The main questions regarding the Ising model are the following: 1. How can we sample efficiently from the discrete distribution p T? Gibbs sampler (approximate simulation) 2. How can we compute the common mode(s) of the distributions p T, that is (one of) the most probable state of the distributions p T? Simulated annealing (approximate computation) Graphcut algorithm (exact computation)
29 The Ising Model: Simulated Annealing
30 Graphcut for the Ising Model Main idea: [Greig et al., 1989] Propose a directed graph such that the capacity c(s, T ) of a cut (S, T ) corresponds to the energy E(J) of some configuration ({J = 1}, {J = 1}). Compute the configuration with minimal energy by solving a max-flow problem. Proposed graph: V = (s, t, Ω M,N ) Each edge (s, α) has capacity (I(α) 1) 2. Each edge (α, t) has capacity (I(α) + 1) 2. Each edge (α, β) Ω M,N Ω M,N has capacity 4 = (1 ( 1)) 2. There is more efficient algorithms for this specific graphs [Boykov, Kolmogorov, 2004]
31 Graphcut for the Ising Model V = (s, t, Ω M,N ) Each edge (s, α) has capacity (I(α) 1) 2. Each edge (α, t) has capacity (I(α) + 1) 2. Each edge (α, β) Ω M,N Ω M,N has capacity 4 = (1 ( 1)) 2. Capacity of a cut: Let (S, T ) be a cut of V. Let J such that J(α) = 1 if α S and 1 if α T. c(s, T ) = = (u,v) S T E α T s.t.(s,α) E c(u, v) c(s, α) + α S s.t.(α,t) E c(α, t) + = (I(α) 1) ) α T α S(I(α) 2 + = (I(α) J(α)) 2 + (J(α) J(β)) 2 = E(J). α Ω M,N α β (α,β) S\{s} T \{t} E (α,β) S\{s} T \{t} E (1 ( 1)) 2 c(α, β)
32 Bibliographic references I Boykov, Y. and Kolmogorov, V., An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision IEEE TPAMI, Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C., Introduction to Algorithms, Third Edition, The MIT Press, 2009 D. Mumford and A. Desolneux, Pattern Theory: The Stochastic Analysis of Real-World Signals, Ak Peters Series, 2010 D. M. Greig and B. T. Porteous and A. H. Seheult, Exact Maximum A Posteriori Estimation for Binary Images, Journal of the Royal Statistical Society. Series B (Methodological), 1989
Markov and Gibbs Random Fields
Markov and Gibbs Random Fields Bruno Galerne bruno.galerne@parisdescartes.fr MAP5, Université Paris Descartes Master MVA Cours Méthodes stochastiques pour l analyse d images Lundi 6 mars 2017 Outline The
More informationFlow Network. The following figure shows an example of a flow network:
Maximum Flow 1 Flow Network The following figure shows an example of a flow network: 16 V 1 12 V 3 20 s 10 4 9 7 t 13 4 V 2 V 4 14 A flow network G = (V,E) is a directed graph. Each edge (u, v) E has a
More informationRunning Time. Assumption. All capacities are integers between 1 and C.
Running Time Assumption. All capacities are integers between and. Invariant. Every flow value f(e) and every residual capacities c f (e) remains an integer throughout the algorithm. Theorem. The algorithm
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More information1 Review for Lecture 2 MaxFlow
Comp 260: Advanced Algorithms Tufts University, Spring 2009 Prof. Lenore Cowen Scribe: Wanyu Wang Lecture 13: Back to MaxFlow/Edmonds-Karp 1 Review for Lecture 2 MaxFlow A flow network showing flow and
More informationCS 1501 Recitation. Xiang Xiao
CS 1501 Recitation Xiang Xiao Network Flow A flow network G=(V,E): a directed graph, where each edge (u,v) E has a nonnegative capacity c(u,v)>=0. If (u,v) E, we assume that c(u,v)=0. two distinct vertices
More informationThe max flow problem. Ford-Fulkerson method. A cut. Lemma Corollary Max Flow Min Cut Theorem. Max Flow Min Cut Theorem
The max flow problem Ford-Fulkerson method 7 11 Ford-Fulkerson(G) f = 0 while( simple path p from s to t in G f ) 10-2 2 1 f := f + f p output f 4 9 1 2 A cut Lemma 26. + Corollary 26.6 Let f be a flow
More informationdirected weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time
Network Flow 1 The Maximum-Flow Problem directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time 2 Maximum Flows and Minimum Cuts flows and cuts max flow equals
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP32/382/90/980 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 7: MAXIMUM FLOW COMP32/382/90/980 / 24 Flow Networks A flow
More informationTypes of Networks. Internet Telephone Cell Highways Rail Electrical Power Water Sewer Gas
Flow Networks Network Flows 2 Types of Networks Internet Telephone Cell Highways Rail Electrical Power Water Sewer Gas 3 Maximum Flow Problem How can we maximize the flow in a network from a source or
More informationMaximum Flow. Jie Wang. University of Massachusetts Lowell Department of Computer Science. J. Wang (UMass Lowell) Maximum Flow 1 / 27
Maximum Flow Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) Maximum Flow 1 / 27 Flow Networks A flow network is a weighted digraph G = (V, E), where the
More information10 Max-Flow Min-Cut Flows and Capacitated Graphs 10 MAX-FLOW MIN-CUT
10 Max-Flow Min-Cut 10.1 Flows and Capacitated Graphs Previously, we considered weighted graphs. In this setting, it was natural to thinking about minimizing the weight of a given path. In fact, we considered
More informationMaximum flow problem
Maximum flow problem 7000 Network flows Network Directed graph G = (V, E) Source node s V, sink node t V Edge capacities: cap : E R 0 Flow: f : E R 0 satisfying 1. Flow conservation constraints e:target(e)=v
More informationFlows and Cuts. 1 Concepts. CS 787: Advanced Algorithms. Instructor: Dieter van Melkebeek
CS 787: Advanced Algorithms Flows and Cuts Instructor: Dieter van Melkebeek This lecture covers the construction of optimal flows and cuts in networks, their relationship, and some applications. It paves
More informationGraph Algorithms -2: Flow Networks. N. H. N. D. de Silva Dept. of Computer Science & Eng University of Moratuwa
CS4460 Advanced d Algorithms Batch 08, L4S2 Lecture 9 Graph Algorithms -2: Flow Networks Dept. of Computer Science & Eng University of Moratuwa Announcement Assignment 2 is due on 18 th of November Worth
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 2 Network Flow Finish bipartite matching apacity-scaling algorithm Adam Smith 0//0 A. Smith; based on slides by E. Demaine,. Leiserson, S. Raskhodnikova, K. Wayne Marriage
More informationThe min cost flow problem Course notes for Search and Optimization Spring 2004
The min cost flow problem Course notes for Search and Optimization Spring 2004 Peter Bro Miltersen February 20, 2004 Version 1.3 1 Definition of the min cost flow problem We shall consider a generalization
More informationLecture 2: Network Flows 1
Comp 260: Advanced Algorithms Tufts University, Spring 2011 Lecture by: Prof. Cowen Scribe: Saeed Majidi Lecture 2: Network Flows 1 A wide variety of problems, including the matching problems discussed
More informationAlgorithms and Theory of Computation. Lecture 11: Network Flow
Algorithms and Theory of Computation Lecture 11: Network Flow Xiaohui Bei MAS 714 September 18, 2018 Nanyang Technological University MAS 714 September 18, 2018 1 / 26 Flow Network A flow network is a
More informationThe min cost flow problem Course notes for Optimization Spring 2007
The min cost flow problem Course notes for Optimization Spring 2007 Peter Bro Miltersen February 7, 2007 Version 3.0 1 Definition of the min cost flow problem We shall consider a generalization of the
More informationProblem set 1. (c) Is the Ford-Fulkerson algorithm guaranteed to produce an acyclic maximum flow?
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 1 Electronic submission to Gradescope due 11:59pm Thursday 2/2. Form a group of 2-3 students that is, submit one homework with all of your names.
More informationTwo Applications of Maximum Flow
Two Applications of Maximum Flow The Bipartite Matching Problem a bipartite graph as a flow network maximum flow and maximum matching alternating paths perfect matchings 2 Circulation with Demands flows
More informationMax Flow: Algorithms and Applications
Max Flow: Algorithms and Applications Outline for today Quick review of the Max Flow problem Applications of Max Flow The Ford-Fulkerson (FF) algorithm for Max Flow Analysis of FF, and the Max Flow Min
More informationWe say that a flow is feasible for G (or just feasible if the graph and capacity function in question are obvious) if
CS787: Advanced Algorithms Lecture 4: Network Flow We devote this lecture to the network flow problem and the max-flow min-cut theorem. A number of other problems can be cast into a maximum flow or minimum
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 28 Network Flow hoosing good augmenting paths apacity scaling algorithm A. Smith /4/2008 A. Smith; based on slides by K. Wayne and S. Raskhodnikova Pre-break: Ford-Fulkerson
More informationAlgorithms: Lecture 12. Chalmers University of Technology
Algorithms: Lecture 1 Chalmers University of Technology Today s Topics Shortest Paths Network Flow Algorithms Shortest Path in a Graph Shortest Path Problem Shortest path network. Directed graph G = (V,
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III Instructor: Shaddin Dughmi Announcements Today: Spanning Trees and Flows Flexibility awarded
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationThe Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate
Journal of Information Processing Vol.24 No.2 390 394 (Mar. 206) [DOI: 0.297/ipsjjip.24.390] Regular Paper The Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationPreliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}
Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)
More informationMaximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai
Maximum Flow Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Flow Network A low network G ( V, E) is a directed graph with a source node sv, a sink node tv, a capacity unction c. Each edge ( u,
More informationAgenda. Soviet Rail Network, We ve done Greedy Method Divide and Conquer Dynamic Programming
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Now Flow Networks, Max-flow Min-cut and Applications c Hung Q. Ngo (SUNY at Buffalo) CSE 531 Algorithm Analysis and Design 1 / 52
More informationEnergy minimization via graph-cuts
Energy minimization via graph-cuts Nikos Komodakis Ecole des Ponts ParisTech, LIGM Traitement de l information et vision artificielle Binary energy minimization We will first consider binary MRFs: Graph
More informationCSC 373: Algorithm Design and Analysis Lecture 12
CSC 373: Algorithm Design and Analysis Lecture 12 Allan Borodin February 4, 2013 1 / 16 Lecture 12: Announcements and Outline Announcements Term test 1 in tutorials. Need to use only two rooms due to sickness
More informationCSE 326: Data Structures Network Flow. James Fogarty Autumn 2007
CSE 36: Data Structures Network Flow James Fogarty Autumn 007 Network Flows Given a weighted, directed graph G=(V,E) Treat the edge weights as capacities How much can we flow through the graph? A 1 B 7
More informationDiscrete Optimization Lecture 5. M. Pawan Kumar
Discrete Optimization Lecture 5 M. Pawan Kumar pawan.kumar@ecp.fr Exam Question Type 1 v 1 s v 0 4 2 1 v 4 Q. Find the distance of the shortest path from s=v 0 to all vertices in the graph using Dijkstra
More information. CS711008Z Algorithm Design and Analysis. Lecture 10. Algorithm design technique: Network flow and its applications 1. Dongbo Bu
CS711008Z Algorithm Design and Analysis Lecture 10 Algorithm design technique: Network flow and its applications 1 Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China
More informationInternet Routing Example
Internet Routing Example Acme Routing Company wants to route traffic over the internet from San Fransisco to New York. It owns some wires that go between San Francisco, Houston, Chicago and New York. The
More informationParallel Graph Algorithms (con4nued)
Parallel Graph Algorithms (con4nued) MaxFlow A flow network G=(V,E): a directed graph, where each edge (u,v) E has a nonnega4ve capacity c(u,v)>=0. If (u,v) E, we assume that c(u,v)=0. Two dis4nct ver4ces
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationExposition of the Dinitz algorithm
Exposition of the Dinitz algorithm Yefim Dinitz and Avraham A. Melkman Department of Computer Science Ben Gurion University of the Negev, 84105 Beer-Sheva, Israel {dinitz,melkman}@cs.bgu.ac.il June 6,
More informationParallel Graph Algorithms (con4nued)
Parallel Graph Algorithms (con4nued) MaxFlow A flow network G=(V,E): a directed graph, where each edge (u,v) E has a nonnega4ve capacity c(u,v)>=0. If (u,v) E, we assume that c(u,v)=0. Two dis4nct ver4ces
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationZero-Sum Games Public Strategies Minimax Theorem and Nash Equilibria Appendix. Zero-Sum Games. Algorithmic Game Theory.
Public Strategies Minimax Theorem and Nash Equilibria Appendix 2013 Public Strategies Minimax Theorem and Nash Equilibria Appendix Definition Definition A zero-sum game is a strategic game, in which for
More informationMultiresolution Graph Cut Methods in Image Processing and Gibbs Estimation. B. A. Zalesky
Multiresolution Graph Cut Methods in Image Processing and Gibbs Estimation B. A. Zalesky 1 2 1. Plan of Talk 1. Introduction 2. Multiresolution Network Flow Minimum Cut Algorithm 3. Integer Minimization
More informationComputer Science & Engineering 423/823 Design and Analysis of Algorithms
Bipartite Matching Computer Science & Engineering 423/823 Design and s Lecture 07 (Chapter 26) Stephen Scott (Adapted from Vinodchandran N. Variyam) 1 / 36 Spring 2010 Bipartite Matching 2 / 36 Can use
More informationEnergy Minimization via Graph Cuts
Energy Minimization via Graph Cuts Xiaowei Zhou, June 11, 2010, Journal Club Presentation 1 outline Introduction MAP formulation for vision problems Min-cut and Max-flow Problem Energy Minimization via
More informationGRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017)
GRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017) C. Croitoru croitoru@info.uaic.ro FII November 12, 2017 1 / 33 OUTLINE Matchings Analytical Formulation of the Maximum Matching Problem Perfect Matchings
More informationCS 170 DISCUSSION 10 MAXIMUM FLOW. Raymond Chan raychan3.github.io/cs170/fa17.html UC Berkeley Fall 17
7 IUION MXIMUM FLOW Raymond han raychan.github.io/cs7/fa7.html U erkeley Fall 7 MXIMUM FLOW Given a directed graph G = (V, E), send as many units of flow from source node s to sink node t. Edges have capacity
More informationINVERSE SPANNING TREE PROBLEMS: FORMULATIONS AND ALGORITHMS
INVERSE SPANNING TREE PROBLEMS: FORMULATIONS AND ALGORITHMS P. T. Sokkalingam Department of Mathematics Indian Institute of Technology, Kanpur-208 016, INDIA Ravindra K. Ahuja Dept. of Industrial & Management
More informationMathematics for Decision Making: An Introduction. Lecture 13
Mathematics for Decision Making: An Introduction Lecture 13 Matthias Köppe UC Davis, Mathematics February 17, 2009 13 1 Reminder: Flows in networks General structure: Flows in networks In general, consider
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More information6.046 Recitation 11 Handout
6.046 Recitation 11 Handout May 2, 2008 1 Max Flow as a Linear Program As a reminder, a linear program is a problem that can be written as that of fulfilling an objective function and a set of constraints
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationLecture 1. 1 Overview. 2 Maximum Flow. COMPSCI 532: Design and Analysis of Algorithms August 26, 2015
COMPSCI 532: Design and Analysis of Algorithms August 26, 205 Lecture Lecturer: Debmalya Panigrahi Scribe: Allen Xiao Oeriew In this lecture, we will define the maximum flow problem and discuss two algorithms
More informationExact MAP Activity Detection in fmri Using a GLM with an Ising Spatial Prior
Exact MAP Activity Detection in fmri Using a GLM with an Ising Spatial Prior Eric R. Cosman, Jr. 1, John W. Fisher III 1, and William M. Wells III 1,2 1 Massachusetts Institute of Technology, Computer
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationDiscrete Optimization 2010 Lecture 3 Maximum Flows
Remainder: Shortest Paths Maximum Flows Discrete Optimization 2010 Lecture 3 Maximum Flows Marc Uetz University of Twente m.uetz@utwente.nl Lecture 3: sheet 1 / 29 Marc Uetz Discrete Optimization Outline
More informationAn example of LP problem: Political Elections
Linear Programming An example of LP problem: Political Elections Suppose that you are a politician trying to win an election. Your district has three different types of areas: urban, suburban, and rural.
More informationReducing graphs for graph cut segmentation
for graph cut segmentation Nicolas Lermé 1,2, François Malgouyres 1, Lucas Létocart 2 1 LAGA, 2 LIPN Université Paris 13 CANUM 2010, Carcans-Maubuisson, France June 1, 2010 1/42 Nicolas Lermé, François
More informationCSCE423/823. Introduction. Flow Networks. Ford-Fulkerson Method. Edmonds-Karp Algorithm. Maximum Bipartite Matching 2/35 CSCE423/823.
1/35 2pt 0em Computer Science & Engineering 423/823 Design and s Lecture 07 (Chapter 26) Stephen Scott (Adapted from Vinodchandran N. Variyam) 2/35 Can use a directed graph as a flow network to model:
More informationFlows. Chapter Circulations
Chapter 4 Flows For a directed graph D = (V,A), we define δ + (U) := {(u,v) A : u U,v / U} as the arcs leaving U and δ (U) := {(u,v) A u / U,v U} as the arcs entering U. 4. Circulations In a directed graph
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions. What does the Representation Theorem say (in linear programming)? In words, the representation theorem says that any feasible point can be written
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More information1 Perfect Matching and Matching Polytopes
CS 598CSC: Combinatorial Optimization Lecture date: /16/009 Instructor: Chandra Chekuri Scribe: Vivek Srikumar 1 Perfect Matching and Matching Polytopes Let G = (V, E be a graph. For a set E E, let χ E
More informationSome links between extremum spanning forests, watersheds and min-cuts
Some links between extremum spanning forests, watersheds and min-cuts Cédric Allène a,b, Jean-Yves Audibert a, Michel Couprie b and Renaud Keriven a a Université Paris-Est, CERTIS, Ecole des Ponts ParisTech,
More informationCSC2420: Algorithm Design, Analysis and Theory Fall 2017
CSC2420: Algorithm Design, Analysis and Theory Fall 2017 Allan Borodin and Nisarg Shah October 11, 2017 1 / 32 Lecture 5 Announcements: The first assignment is due next week, October 18, at 1:00 PM The
More informationLecture 9 Tuesday, 4/20/10. Linear Programming
UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Spring, 2010 Lecture 9 Tuesday, 4/20/10 Linear Programming 1 Overview Motivation & Basics Standard & Slack Forms Formulating
More informationHertz, Krogh, Palmer: Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company (1991). (v ji (1 x i ) + (1 v ji )x i )
Symmetric Networks Hertz, Krogh, Palmer: Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company (1991). How can we model an associative memory? Let M = {v 1,..., v m } be a
More informationCombinatorial Optimization
Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is
More informationRecall: Matchings. Examples. K n,m, K n, Petersen graph, Q k ; graphs without perfect matching
Recall: Matchings A matching is a set of (non-loop) edges with no shared endpoints. The vertices incident to an edge of a matching M are saturated by M, the others are unsaturated. A perfect matching of
More informationCSE 202 Homework 4 Matthias Springer, A
CSE 202 Homework 4 Matthias Springer, A99500782 1 Problem 2 Basic Idea PERFECT ASSEMBLY N P: a permutation P of s i S is a certificate that can be checked in polynomial time by ensuring that P = S, and
More informationMaximum flow problem CE 377K. February 26, 2015
Maximum flow problem CE 377K February 6, 05 REVIEW HW due in week Review Label setting vs. label correcting Bellman-Ford algorithm Review MAXIMUM FLOW PROBLEM Maximum Flow Problem What is the greatest
More informationChemical Reaction Optimization for Max Flow Problem
Chemical Reaction Optimization for Max Flow Problem Reham Barham Department of Computer Science King Abdulla II School for Information and Technology The University of Jordan Amman, Jordan Ahmad Sharieh
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationStandard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.
5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered
More information1 Integer Decomposition Property
CS 598CSC: Combinatorial Optimization Lecture date: Feb 2, 2010 Instructor: Chandra Chekuri Scribe: Siva Theja Maguluri Material taken mostly from [1] (Chapter 19). 1 Integer Decomposition Property A polyhedron
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 7 Network Flow Application: Bipartite Matching Adam Smith 0//008 A. Smith; based on slides by S. Raskhodnikova and K. Wayne Recently: Ford-Fulkerson Find max s-t flow
More informationCONSTRAINED PERCOLATION ON Z 2
CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability
More informationp 3 p 2 p 4 q 2 q 7 q 1 q 3 q 6 q 5
Discrete Fréchet distance Consider Professor Bille going for a walk with his personal dog. The professor follows a path of points p 1,..., p n and the dog follows a path of points q 1,..., q m. We assume
More informationQuadratic Programming Relaxations for Metric Labeling and Markov Random Field MAP Estimation
Quadratic Programming Relaations for Metric Labeling and Markov Random Field MAP Estimation Pradeep Ravikumar John Lafferty School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213,
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationThe maximum flow problem
The maximum flow problem A. Agnetis 1 Basic properties Given a network G = (N, A) (having N = n nodes and A = m arcs), and two nodes s (source) and t (sink), the maximum flow problem consists in finding
More informationLecture 21 November 11, 2014
CS 224: Advanced Algorithms Fall 2-14 Prof. Jelani Nelson Lecture 21 November 11, 2014 Scribe: Nithin Tumma 1 Overview In the previous lecture we finished covering the multiplicative weights method and
More information15.083J/6.859J Integer Optimization. Lecture 10: Solving Relaxations
15.083J/6.859J Integer Optimization Lecture 10: Solving Relaxations 1 Outline The key geometric result behind the ellipsoid method Slide 1 The ellipsoid method for the feasibility problem The ellipsoid
More informationLecture 11: Generalized Lovász Local Lemma. Lovász Local Lemma
Lecture 11: Generalized Recall We design an experiment with independent random variables X 1,..., X m We define bad events A 1,..., A n where) the bad event A i depends on the variables (X k1,..., X kni
More informationComputing Maximum Flow with Augmenting Electrical Flows
Computing Maximum Flow with Augmenting Electrical Flows Aleksander Mądry MIT madry@mit.edu Abstract ( ) We present an Õ m 0 7 U 7 -time algorithm for the maximum s-t flow problem (and the minimum s-t cut
More informationLagrange Relaxation: Introduction and Applications
1 / 23 Lagrange Relaxation: Introduction and Applications Operations Research Anthony Papavasiliou 2 / 23 Contents 1 Context 2 Applications Application in Stochastic Programming Unit Commitment 3 / 23
More informationMA015: Graph Algorithms
MA015 3. Minimum cuts 1 MA015: Graph Algorithms 3. Minimum cuts (in undirected graphs) Jan Obdržálek obdrzalek@fi.muni.cz Faculty of Informatics, Masaryk University, Brno All pairs flows/cuts MA015 3.
More informationCOMP3121/9101/3821/9801 Lecture Notes. Linear Programming
COMP3121/9101/3821/9801 Lecture Notes Linear Programming LiC: Aleks Ignjatovic THE UNIVERSITY OF NEW SOUTH WALES School of Computer Science and Engineering The University of New South Wales Sydney 2052,
More informationAlgorithm Theory - Exercise Class
Algorithm Theory - Exercise Class Exercise Lesson 3 Albert-Ludwigs-Universität Freiburg Philipp Schneider Algorithms and Complexity - Professor Dr. Fabian Kuhn Organizational Matters English Tutorial in
More informationNetwork Flows made simple
Network Flows made simple A mild but rigorous introduction to Network Flows Periklis A. Papakonstantinou York University Network Flows is the last algorithmic paradigm we consider. Actually, we only address
More informationPart V. Matchings. Matching. 19 Augmenting Paths for Matchings. 18 Bipartite Matching via Flows
Matching Input: undirected graph G = (V, E). M E is a matching if each node appears in at most one Part V edge in M. Maximum Matching: find a matching of maximum cardinality Matchings Ernst Mayr, Harald
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationOutline. Outline. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Scheduling CPM/PERT Resource Constrained Project Scheduling Model
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 and Mixed Integer Programg Marco Chiarandini 1. Resource Constrained Project Model 2. Mathematical Programg 2 Outline Outline 1. Resource Constrained
More information6. Linear Programming
Linear Programming 6-1 6. Linear Programming Linear Programming LP reduction Duality Max-flow min-cut, Zero-sum game Integer Programming and LP relaxation Maximum Bipartite Matching, Minimum weight vertex
More informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
More information