Occlusions, discontinuities, and epipolar lines in stereo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1406, Issue , 1998, Pages 232-248

  Ishikawa, Hiroshi ^a   Geiger, Davi ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; FLOW GRAPHS; GLOBAL OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; STEREO IMAGE PROCESSING;

BINOCULAR STEREO; DEPTH INFORMATION; GEOMETRIC CONSTRAINT; GLOBAL OPTIMIZATION PROBLEMS; GLOBAL SOLUTIONS; MAXIMUM FLOW PROBLEMS; OPTIMIZATION FUNCTION; OPTIMIZATION PROBLEMS;

COMPUTER VISION;

EID: 84957650547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055670     Document Type: Conference Paper

References (22)

1. B. Anderson. The role of partial occlusion in stereopsis. Nature, 367:365-368, 1994.
2. N. Ayache. Artificial Vision for Mobile Robots. MIT Press. Cambridge, Mass., 1991.
3. P. N. Belhumeur and D. Mumford. A bayesian treatment of the stereo correspondence problem using half-occluded regions. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 1992.
4. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, Cambridge, Mass., 1987.
5. P. Burt and B. Lulesz. A disparity gradient limit for binocular fusion. Science, 208:615-617, 1980.
6. B. Cernushi-Frias, D. B. Cooper, Y. P. Hung, and P. Belhumeur. Towards a model-based bayesian theory for estimating and recognizing parameterized 3d objects using two or more images taken from different positions. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-11:1028-1052, 1989.
7. A. Champolle, D. Geiger, and S. Mallat. Un algorithme multi-échelle de mise encorrespon- dance stéréo base sur les champs markoviens. In 13th GRETSI Conference on Signal and Image Processing, Juan-les-Pins, France, Sept. 1991.
8. B. V. Cherkassky and A. V. Goldberg On Implementing Push-Relabel Method for the Maximum Flow Problem. In Proc. 4th Int. Programming and Combinatorial Optimization Conf., pages 157-171, 1995.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGrow-Hill, New York, 1990.
10. O. Faugeras Three-Dimensional Computer Vision. MIT Press. Cambridge, Mass., 1993.
11. D. Geiger and B. Ladendorf and A. Yuille Occlusions and binocular stereo. International Journal of Computer Vision, 14, pp 211-226 March, 1995.
12. B. Gillam and E. Borsting. The role of monocular regions in stereoscopic displays. Perception, 17:603-608, 1988.
13. W. E. L. Grimson. From Images to Surfaces. MIT Press. Cambridge, Mass., 1981.
14. B. Julesz. Foundations of Cyclopean Perception. The University of Chicago Press, Chicago, 1971.
15. T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: theory and experiments. In Proc. Image Understanding Workshop DARPA, PA, September 1990.
16. J. Malik. On Binocularly viewed occlusion Junctions. In Fourth European Conference on Computer Vision, vol.1, pages 167-174, Cambridge, UK, 1996. Springer-Verlag.
17. D. Marr and T. Poggio. Cooperative computation of stereo disparity. Science, 194:283-287, 1976.
18. D. Marr and T. Poggio. A computational theory of human stereo vision. Proceedings of the Royal Society of London B, 204:301-328, 1979.
19. K. Nakayama and S. Shimojo. Da vinci stereopsis: depth and subjective occluding contours from unpaired image points. Vision Research, 30:1811-1825, 1990.
20. Y. Ohta and T. Kanade. Stereo by intra- and inter-scanline search using dynamic programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-7(2): 139-154, 1985.
21. S. B. Pollard, J. E. W. Mayhew, and J. P. Frisby. Disparity gradients and stereo correspondences. Perception, 1987.
22. S. Roy and I. Cox. A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem In Proc. Int. Conf. on Computer Vision, 1CCV'98, Bombay, India 1998.