Login / Signup
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem.
Sébastien Roy
Ingemar J. Cox
Published in:
ICCV (1998)
Keyphrases
</>
maximum flow
minimum cut
directed graph
vision system
push relabel
stereo vision
focal length
quadratic programming
input image
graphical models
markov chain
np complete
stereo correspondence
min cut
directed networks