This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed whose nodes represent the individual pixels and whose edges are along the epipolar lines. Using the well known uniqueness and ordering constraint for pair by pair matches simultaneously, a path with the least matching cost is found using dynamic programming and the disparity filled along the path. This process is repeated iteratively until the disparity at all the pixels are filled up. To demonstrate the effectiveness of our approach, we present results from real world images and compare it with the traditional line by line stereo using dynamic programming.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Trinocular stereo using shortest paths and the ordering constraint


    Contributors:
    Agrawal, M. (author) / Davis, L.S. (author)


    Publication date :

    2001-01-01


    Size :

    552430 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Trinocular Stereo Using Shortest Paths and the Ordering Constraint

    Agrawal, M. / Davis, L. S. / IEEE Computer Society | British Library Conference Proceedings | 2001


    Trinocular Stereo Using Shortest Paths and the Ordering Constraint

    Agrawal, M. | British Library Online Contents | 2002


    A highly parallel trinocular stereo algorithmus

    Ferrari,D. / Garibotto,G. / Pardo,A. et al. | Automotive engineering | 1988


    Trinocular Stereo: A Real-Time Algorithm and Its Evaluation

    Mulligan, J. / Isler, V. / Daniilidis, K. et al. | British Library Conference Proceedings | 2001


    Trinocular Stereo A Real-Time Algorithm and its Evaluation

    Mulligan, J. / Isler, V. / Daniilidis, K. | British Library Online Contents | 2002