Professional Documents
Culture Documents
Lecture 22 Network Flow Applications PDF
Lecture 22 Network Flow Applications PDF
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Bipartite matching.
Network reliability.
Data mining.
Distributed computing.
Project selection.
Airline scheduling.
Baseball elimination.
Image segmentation.
Network connectivity.
Open-pit mining.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Bipartite matching.
Network reliability.
Data mining.
Distributed computing.
Project selection.
Airline scheduling.
Baseball elimination.
Image segmentation.
Network connectivity.
Open-pit mining.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Bipartite matching.
Network reliability.
Data mining.
Distributed computing.
Project selection.
Airline scheduling.
Baseball elimination.
Image segmentation.
Network connectivity.
Open-pit mining.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Claim: the value of the maximum flow is the size of the maximum matching.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
C n.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
For example, two nodes in X with one incident edge each with the same
neighbour in Y .
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
For example, two nodes in X with one incident edge each with the same
neighbour in Y .
Generally, a subset A X with neighbours (A) Y , such that |A| > |(A)|.
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
For example, two nodes in X with one incident edge each with the same
neighbour in Y .
Generally, a subset A X with neighbours (A) Y , such that |A| > |(A)|.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
For example, two nodes in X with one incident edge each with the same
neighbour in Y .
Generally, a subset A X with neighbours (A) Y , such that |A| > |(A)|.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Edge-Disjoint Paths
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Edge-Disjoint Paths
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
Paths flow: if there are k edge-disjoint paths from s to t, send one unit of
flow along each to yield a flow with value k.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
Paths flow: if there are k edge-disjoint paths from s to t, send one unit of
flow along each to yield a flow with value k.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
Paths flow: if there are k edge-disjoint paths from s to t, send one unit of
flow along each to yield a flow with value k.
I
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
Paths flow: if there are k edge-disjoint paths from s to t, send one unit of
flow along each to yield a flow with value k.
I
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Convert G into a flow network: s is the source, t is the sink, each edge has
capacity 1.
Paths flow: if there are k edge-disjoint paths from s to t, send one unit of
flow along each to yield a flow with value k.
I
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Replace each edge with two directed edges of capacity 1 and apply the
algorithm for directed graphs.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Replace each edge with two directed edges of capacity 1 and apply the
algorithm for directed graphs.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Replace each edge with two directed edges of capacity 1 and apply the
algorithm for directed graphs.
Can obtain an integral flow where only one of the directed counterparts of
(u, v ) has non-zero flow.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Replace each edge with two directed edges of capacity 1 and apply the
algorithm for directed graphs.
Can obtain an integral flow where only one of the directed counterparts of
(u, v ) has non-zero flow.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Image Segmentation
I
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Each pixel i has a likelihood ai > 0 that it belongs to the foreground and a
likelihood bi > 0 that it belongs to the background.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Each pixel i has a likelihood ai > 0 that it belongs to the foreground and a
likelihood bi > 0 that it belongs to the background.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Each pixel i has a likelihood ai > 0 that it belongs to the foreground and a
likelihood bi > 0 that it belongs to the background.
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
jB
(i,j)E
|A{i,j}|=1
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Maximization to Minimization
I
Let Q =
T. M. Murali
i (ai
+ bi ).
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
Maximization to Minimization
I
Let Q =
i (ai
Notice that
Therefore, maximising
q(A, B) =
+ bi ).
iA ai
jB
bj = Q
ai +
iA
iA
bi
iA
bi +
iA
T. M. Murali
jB
aj .
pij
(i,j)E
|A{i,j}|=1
aj
jB
is identical to minimising
q 0 (A, B)
bj
jB
bi +
X
jB
aj +
pij
(i,j)E
|A{i,j}|=1
pij
(i,j)E
|A{i,j}|=1
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
T. M. Murali
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
I
I
I
T. M. Murali
(s, w ), w B contributes aw .
(u, t), u A contributes bu .
(u, w ), u A, w B contributes
puw .
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
I
I
I
(s, w ), w B contributes aw .
(u, t), u A contributes bu .
(u, w ), u A, w B contributes
puw .
c(A, B)
X
iA
T. M. Murali
bi +
aj +
jB
(i,j)E
|A{i,j}|=1
Introduction
Bipartite Matching
Edge-Disjoint Paths
Image Segmentation
The capacity of a s-t cut c(A, B) exactly measures the quantity q 0 (A, B).
To maximise q(A, B), we simply compute the s-t cut (A, B) of minimum
capacity.
Deleting s and t from the cut yields the desired segmentation of the image.
T. M. Murali