Learning from Labeled and Unlabeled Data using Graph Mincuts
A maximum-flow formulation of the N-camera stereo correspondence problem