Stereo matching by graph cuts
d1
d2
d3
Graph Cut
•Delete
enough edges so that
–each
pixel is (transitively) connected to exactly one label node
•Cost
of a cut: sum of deleted edge
weights
•Finding
min cost cut equivalent to finding global minimum of the
energy function