
Graphs and Images 187
F
B
F
B
t-links
n-links
pixel nodes
terminal
nodes
F
B
background
cut
foreground
Figure 12.8: The graph created from an image for segmenting before
(left) and after (right) the graph cut.
energy function E(L) allows us to look for the minimum cut that
separates the two terminal nodes. This cut also minimizes the en-
ergy function E(L) and provides a global optimum for our original
foreground–background separation problem.
The t-links’ weights are inversely proportional to the data term.
Every terminal represents the color model of the background or
foreground. The more similar a pixel’s color is to the terminal’s
color model, the ...