Optimization (4)
•
Graph cuts.
(eg., Boykov, Veksler, and Zabih).
–
Find all sites labeled
b.
Relabel a subset of
these
a,
so that energy is minimized over
all possible such relabelings.
–
This can be posed as a graph cut problem,
solved optimally in polynomial time.