Stereo correspondence by dynamic programming on a tree

Proceedings - 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

Volumn II, Issue , 2005, Pages 384-390

  Veksler, Olga ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; GLOBAL OPTIMIZATION; STEREO VISION; TREES (MATHEMATICS);

INDIVIDUAL SCANLINES; PIXELS; STEREO CORRESPONDENCE; VERTICAL CONSISTENCY;

IMAGE ANALYSIS;

EID: 24644500353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2005.334     Document Type: Conference Paper

References (21)

1. H. Baker and T. Binford. Depth from edge and intensity based stereo. In IJCAI 81, pages 631-636, 1981.
2. S. Birchfield and C. Tomasi. Depth discontinuities by pixel-to-pixel stereo. IJCV, 35(3): 1-25. December 1999.
3. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, 1987.
4. A. Bobick and S. Intille. Large occlusion stereo. In Vismod, 1999.
5. G. Borgefors. Distance transformations in digital images. CVGIP, 34(3):344-371. June 1986.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In International Conference on Computer Vision, pages 377-384, 1999.
7. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
8. I. Cox, S. Hingorani, S. Rao, and B. Maggs. A maximum likelihood stereo algorithm. Computer Vision, Graphics and Image Processing, 63(3):542-567, 1996.
9. P. Felzenszwalb and D. Huttenlocher. Efficient belief propagation for early vision. In CVPR04, pages I: 261-268, 2004.
10. P. Felzenszwalb and D. Huttenlocher. Pictorial structures for object recognition. IJCV, 61(1):55-79, January 2005.
11. D. Geiger and F. Girosi. Parallel and deterministic algorithms from MRF's: Surface reconstruction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(5):401-412, May 1991.
12. S. Geman and D. Geman. Stochastic relaxation. Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741, 1984.
13. H. Ishikawa. Exact optimization for markov random fields with convex priors. PAMI, 25(10): 1333-1336, October 2003.
14. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. In Tenth International Workshop on Artificial Intelligence and Statistics. January 2005.
15. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In ECCV02, page III: 82 ff., 2002.
16. Y. Ohta and T. Kanade. Stereo by intra- and inter-scanline search. TPAMI. 2:449-470, 1985.
17. L. Rabiner and B. Juang. Fundamentals of Speech Recognition. Prentice Hall, 1993.
18. S. Roy. Stereo without epipolar lines: A maximum-flow formulation. IJCV, 34(2-3): 147-161. August 1999.
19. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1-3):7-42, April 2002.
20. J. Sun, N. Zheng, and H. Shum. Stereo matching using belief propagation. PAMI, 25(7):787-800, July 2003.
21. M. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Transactions on Information Theory, 45(9): 1120-1146, May 2001.