Surfaces with occlusions from layered stereo

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2003, Pages

  Lin, Michael H ^a   Tomasi, Carlo ^b  

^a STANFORD UNIVERSITY   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE QUALITY; IMAGE SEGMENTATION; SURFACES;

IMAGE GRADIENTS; STEREO ALGORITHMS;

STEREO VISION;

EID: 17644446354     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Y. S. Akgul and C. Kambhamettu. Recovery and tracking of continuous 3D surfaces from stereo data using a deformable dual-mesh. In ICCV, pp. 765-772, 1999.
2. S. Baker, R. Szeliski, and P. Anandan. A layered approach to stereo reconstruction. In CVPR, pp. 434-441, 1998.
3. S. T. Barnard and M. A. Fischler. Computational stereo. Computing Surveys, 14:553-572, 1982.
4. P. N. Belhumeur. A Bayesian approach to binocular stereopsis. IJCV, 19:237-260, 1996.
5. S. Birchfield and C. Tomasi. Multiway cut for stereo and motion with slanted surfaces. In ICCV, pp 489-495, 1999.
6. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, Cambridge, MA, 1987.
7. A. F. Bobick and S. S. Intille. Large occlusion stereo. IJCV, 33(3):181-200, 1999.
8. Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In CVPR, pp 648-655, 1998.
9. Y. Boykov, O. Veksler, and R. Zabih. Approximate energy minimization with discontinuities. In EMMCVPR, pp 205-220, 1999.
10. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(11), 2001.
11. I. J. Cox, S. L. Hingorani, S. B. Rao, and B. Maggs. A maximum likelihood stereo algorithm. CVIU, 63(3):542-567, 1996.
12. T. Darrell and A. Pentland. Cooperative robust estimation using layers of support. PAMI, 17(5):474-487, 1995.
13. U. R. Dhond and J. K. Aggarwal. Structure from stereo - a review. IEEE SMC, 19(6): 1489-1510, 1989.
14. D. Geiger, B. Ladendorf, and A. Yuille. Occlusions and binocular stereo. IJCV, 14(3):211-226, 1995.
15. H. Hirschmüller, P. R. Innocent, and J. Garibaldi. Real-time correlation-based stereo vision with reduced border errors. IJCV, 47:229-246, 2002.
16. H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. In ECCV, vol. 1, pp. 232-249, 1998.
17. T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. PAMI, 16(9):920-932, 1994.
18. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions using graph cuts. In ICCV, pp 508-515, 2001.
19. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In ECCV, vol. 3, pp 65-81, 2002.
20. M. Lin. Surfaces with Occlusions from Layered Stereo. PhD thesis, Stanford University, 2002. See also http://robotics.stanford.edu/~michelin/layered_stereo/
21. D. Marr and T. Poggio. Cooperative computation of stereo disparity. Science, 194:283-287, 1976.
22. S. Roy and I. Cox. A maximum-flow formulation of the N-camera stereo correspondence problem. In ICCV, pp 492-499, 1998.
23. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47:7-42, 2002. See also http://www.middlebury.edu/stereo/
24. J. Sun, H.-Y. Shum, and N.-N. Zheng. Stereo matching using belief propagation. In ECCV, vol. 2, pp 510-524, 2002.
25. R. Szeliski and J. Coughlan. Spline-based image registration. IJCV, 22(3):199-218, 1997.
26. H. Tao, H. S. Sawhney, and R. Kumar. A global matching framework for stereo computation. In ICCV, pp 532-539, 2001.
27. C. L. Zitnick and T. Kanade. A cooperative algorithm for stereo matching and occlusion detection. PAMI, 22(7):675-684, 2000.