Stereo matching using reduced-graph cuts

Proceedings - International Conference on Image Processing, ICIP

Volumn 1, Issue , 2006, Pages 237-240

  Zureiki, Ayman ^a   Devy, Michel ^a   Chatila, Raja ^a  

^a LAAS CNRS   (France)

Author keywords

Graph cut; Matching; Stereo vision

Indexed keywords

GRAPH ALGORITHMS; GRAPHIC METHODS; PIXELS; STEREO VISION;

COMPUTATION TIME; GRAPH CUT; LOCAL ANALYSIS; MATCHING; MATCHING PROBLEMS; POTENTIAL VALUES; STEREO MATCHING; STEREO MATCHING ALGORITHM;

STEREO IMAGE PROCESSING;

EID: 48149103936     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2007.4378935     Document Type: Conference Paper

References (13)

1. S. Chambon, Mise en correspondance stéréoscopique d'images couleur en présence d'occultations, Ph.D. thesis, Université Paul Sabatier, 2005.
2. D. Scharstein and R. Szeliski, "A taxonomy and evaluation of dense two-frame stereo correspondence algorithms.," IJCV, vol. 47, no. 1-3, pp. 7-42, 2002.
3. P. Granjean and P. Lasserre, "Stereo vision improvments" m IEEE ICAR, Barcelona, 1995.
4. O. Faugeras and T. Vieville et al., "Real-time correlation-based stereo : algorithm, implementations and applications," Tech. Rep. 2013, INRIA-Sophia Antipolis, 1993.
5. S. Roy, "Stereo without epipolar lines: A maximumflow formulation," IJCV, vol. 34, no. 2-3, pp. 147-161, 1999.
6. H. Ishikawa and D. Geiger, "Occlusions, discontinuities, and epipolar lines in stereo," in Proc. of the 5th ECCV, 1998, pp. 232-248.
7. Y. Boykov, O. Veksler, and R. Zabih, "Markov random fields with efficient approximations," in Proc. of the IEEE CVPR, 1998, pp. 648-655.
8. E. Dahlhaus and D. S. Johnson et al., "The complexity of multiterminal cuts," SIAM Journal on Computing, vol. 23, no. 4, pp. 864-894, 1994.
9. O. Veksler, Efficient graph-based energy minimization methods in computer vision, Ph.D. thesis, Cornell University, 1999.
10. L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, 1962.
11. T. Cormen and R. Rivest et al., Introduction to Algorithms, Second Edition, The MIT Press, 2001.
12. A. Goldberg and R. Tarjan, "A new approach to the maximum-flow problem," Journal of the ACM, vol. 35, no. 4, pp. 921-940, 1988.
13. Y. Boykov and V. Kolmogorov, "An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision," in IEEE Trans. on PAMI, 2004, vol. 26, pp. 1124-1137.