DMCA
A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem (1998)
| Citations: | 258 - 4 self |
BibTeX
@MISC{Roy98amaximum-flow,
author = {Sebastien Roy and Ingemar Cox},
title = {A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum-flow problem. Once solved, the minimum-cut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis provides a more accurate and coherent depth map than the traditional line-by-line stereo. Moreover, the optimality of the depth surface is guaranteed and can be shown to be a generalization of the dynamic programming approach that is widely used in standard stereo. Results show improved depth estimation as well as better handling of depth discontinuities. While the worst case running time is O(n 2 d 2 log(nd)), the observed average running time is O(n 1:2 d 1:3 ) for an image size of n pixels and depth resolution d. 1 Introduction It is well known that depth related displacements in stereo pairs always occur along lines associated to the camera motion, the epipolar lines. These lines r...
Keyphrases
n-camera stereo correspondence problem maximum-flow formulation stereo pair coherent depth map standard stereo image size camera motion depth resolution epipolar line maximumflow yield observed average running time improved depth estimation dynamic programming approach disparity surface depth discontinuity depth surface new algorithm traditional line-by-line stereo whole image maximum-flow problem global approach depth related displacement
