Fast global labeling for real-time stereo using multiple plane sweeps

13th International Fall Workshop Vision, Modeling, and Visualization 2008, VMV 2008

Volumn , Issue , 2008, Pages 243-252

  Zach, Christopher ^a   Gallup, David ^a   Frahm, Jan Michael ^a   Niethammer, Marc ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY INTERACTIONS; DATA PARALLEL; MARKOV RANDOM FIELDS; PLANE SWEEPING; REAL TIME STEREO; REGULAR GRIDS; STEREO METHOD; TOTAL ORDER;

MARKOV PROCESSES;

VISUALIZATION;

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

References (22)

1. J.-F. Aujol, G. Gilboa, T. Chan, and S. Osher. Structure-texture image decomposition-modeling, algorithms, and parameter selection. Int. Journal of Computer Vision, 67(1): 111-136, 2006.
2. Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 648-655, 1998.
3. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 23(11):1222-1239, 2001.
4. X. Bresson, S. Esedoglu, P. Vandergheynst, J. Thiran, and S. Osher. Fast Global Minimization of the Active Contour/Snake Model. Journal of Mathematical Imaging and Vision, 2007.
5. M. Z. Brown, D. Burschka, and G. D. Hager. Advances in computational stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(8):993-1008, 2003.
6. A. Chambolle. An algorithm for total variation minimization and applications. Journal of Mathematical Imaging and Vision, 20(1-2):89-97, 2004.
7. A. Chambolle. Total variation minimization and a class of binary MRF models. In Energy Minimization Methods in Computer Vision and Pattern Recognition, pages 136-152, 2006.
8. 1 function approximation. SIAM Journal on Applied Mathematics, 65(5):1817-1837, 2004.
9. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient belief propagation for early vision. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 261-268, 2004.
10. W. T. Freeman. E. C. Pasztor, and O. T. Carmichael. Learning low-level vision. Int. Journal of Computer Vision, 40(1):25-47, 2000.
11. D. Gallup, J.-M. Frahm, P. Mordohai, Q. Yang, and M. Pollefeys. Real-time plane-sweeping stereo with multiple sweeping directions. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2007.
12. H. Ishikawa. Exact optimization for Markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 25(10):1333-1336, 2003.
13. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 28(10): 1568-1583, 2006.
14. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 26(2): 147-159, 2004.
15. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In IEEE International Conference on Computer Vision (ICCV), 2007.
16. N. Komodakis and G. Tziritas. A new framework for approximate labeling via graph cuts. In IEEE International Conference on Computer Vision (ICCV), 2005.
17. n. Journal of Optimization Theory and Applications, 50(1): 195-200, 1986.
18. M. Nikolova, S. Esedoglu, and T. F. Chan. Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal on Applied Mathematics, 66(5): 1632-1648, 2006.
19. T. Pock, T. Schoenemann, D. Cremers, and H. Bischof. A convex formulation of continuous multi-label problems. In European Conference on Computer Vision (ECCV), 2008. to appear.
20. L. I. Rudin, S. Osher, and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D, 60:259-268, 1992.
21. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. Journal of Computer Vision, 47(1-3):7-42, 2002.
22. M. F. Tappen and W. T. Freeman. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters. In IEEE International Conference on Computer Vision (ICCV), pages 900-907, 2003.