Trinocular stereo using shortest paths and the ordering constraint

Proceedings - IEEE Workshop on Stereo and Multi-Baseline Vision, SMBV 2001

Volumn , Issue , 2001, Pages 3-9

  Agrawal, M ^a   Davis, L S ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; IMAGE MATCHING; ITERATIVE METHODS; PIXELS; STEREO IMAGE PROCESSING; STEREO VISION;

DISPARITY ESTIMATIONS; EPIPOLAR LINE; ORDERING CONSTRAINTS; REAL-WORLD IMAGE; SHORTEST PATH; TRINOCULAR;

DYNAMIC PROGRAMMING;

EID: 84963859156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMBV.2001.988757     Document Type: Conference Paper

References (14)

1. M. Agrawal, D. Harwood, R. Duraiswami, L. Davis, and P. Luther. Three dimensional ultrastructure from transmission electron microscope tilt series. In Proceedings Indian Conference on Vision Graphics and Image Processing, Bangalore, India, December 2000.
2. S. Birchfield and C. Tomasi. Depth discontinuities by pixel-to-pixel stereo. In Proceedings Sixth IEEE International Conference on Computer Vision, pages 1073-1080, Mumbai, India, January 1998.
3. S. Birchfield and C. Tomasi. Multiway cut for stereo and motion with slanted surfaces. In Proceedings of the Seventh International Conference on Computer Vision, pages 489-495, Sept. 1999.
4. Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In Proceedings of the IEEE Conference on Computer Vision and Pattern recognition(CVPR), pages 648-655, 1998.
5. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In Proc. International Conference on Computer Vision, pages 377-384, 1999.
6. I. Cox, S. Hingorani, B. Maggs, and S. Rao. A maximum likelihood stereo algorithm. Computer Vision and Image Understanding, 63(3):542-567, May 1996.
7. R. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Cambridge Uinversity Press, 2000.
8. H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. In Fifth European Conference on Computer Vision, LNCS 1406, pages 232-248. Springer Verlag, June 1998.
9. T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. PAMI, 16(9):920-932, September 1994.
10. Y. Ohta and T. Kanade. Stereo by intra and inter-scanline search using dynamic programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(2):139-154, 1985.
11. Y. Ohta, M. Watanabe, and K. Ikeda. Improving depth map by right-angled trinocular stereo. In ICPR86, pages 519-521, 1986.
12. P. Pritchett and A. Zisserman. Wide baseline stereo matching. In Proc. 6th Int'l Conf. on Computer Vision, pages 754-760, 1998.
13. S. Roy and I. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. In Proc. 6th Intl. Conference on Computer Vision, pages 492-499, 1998.
14. C. V. Stewart and C. R. Dyer. The Trinocular General Support Algorithm: A Three-Camera Stereo Algorithm for Overcoming Binocular Matching Errors. In Proc 2nd Int. Conf. on Computer Vision, pages 134-138, 1988.