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 maximum-flow 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/sup 2/d/sup 2/log(nd)), the observed average running time is O(n/sup 1.2/ d/sup 1.3/) for an image size of n pixels and depth resolution d.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A maximum-flow formulation of the N-camera stereo correspondence problem


    Contributors:
    Roy, S. (author) / Cox, I.J. (author)


    Publication date :

    1998-01-01


    Size :

    1460473 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem

    Roy, S. / Cox, I. J. / IEEE; Computer Society | British Library Conference Proceedings | 1998


    Stereo Without Epipolar Lines: A Maximum-Flow Formulation

    Roy, S. | British Library Online Contents | 1999


    Shape and the Stereo Correspondence Problem

    Ogale, A. S. / Aloimonos, Y. | British Library Online Contents | 2005


    A Maximum Likelihood N-Camera Stereo Algorithm

    Cox, I. J. / Institute of Electrical and Electronics Engineers; Computer Society | British Library Conference Proceedings | 1994