Fast locally consistent dense stereo on multicore

2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops, CVPRW 2010

Volumn , Issue , 2010, Pages 69-76

  Mattoccia, Stefano ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

3-D MEASUREMENT; COARSE-GRAINED; COMPUTATIONAL STRUCTURE; COMPUTER VISION APPLICATIONS; COMPUTING ARCHITECTURE; CONSTRAINED RESOURCES; LIMITED MEMORY; LOCAL CONSISTENCY; MEMORY REQUIREMENTS; MULTI CORE; NON-ITERATIVE; OPTIMIZATION METHOD; PRACTICAL USE; SCANLINE; STEREO ALGORITHMS;

COMPUTER APPLICATIONS; COMPUTER VISION; DYNAMIC PROGRAMMING; OPTIMIZATION; PROGRAM PROCESSORS; TECHNICAL PRESENTATIONS;

COMPUTATIONAL METHODS;

EID: 77956542981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2010.5543767     Document Type: Conference Paper

References (28)

1. S. Birchfield and C. Tomasi. Depth discontinuities by pixelto- pixel stereo. Int. J. Comput. Vision, 35(3):269-293, 1999. 2
2. M. Bleyer, M. Gelautz, C. Rother, and C. Rhemann. A stereo approach that hand les the matting problem via image warping. In CVPR09, pages 501-508, 2009. 2
3. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. IEEE Trans. PAMI, 24:603-619, 2002. 2, 3
4. Y. Deng and X. Lin. A fast line segment based dense stereo algorithm using tree dynamic programming. In Proc. European Conf. on Computer Vision (ECCV 2006), volume 3, pages 201-212, 2006. 1, 3
5. I. Ernst and H. Hirschmüller. Mutual information based semi-global stereo matching on the gpu. In ISVC '08: Proceedings of the 4th International Symposium on Advances in Visual Computing, pages 228-239, 2008. 2, 6
6. S. Gehrig, F. Eberli, and T. Meyer. A real-time low-power stereo vision engine using semi-global matching. In CVS09, pages 134-143, 2009. 1, 2, 6
7. H. Hirschmuller. Accurate and efficient stereo processing by semi-global matching and mutual information. In Proc. Conf. on Computer Vision and Pattern recognition (CVPR 2005), volume 2, pages 807-814, 2005. 2
8. H. Hirschmuller. Stereo processing by semi-global matching and mutual information. IEEE Trans. on PAMI, 2(30):328-341, 2008. 1, 2, 3, 6, 7
9. A. Hosni, M. Bleyer, M. Gelautz, and C. Rhemann. Local stereo matching using geodesic support weights. In ICIP, 2009. 2
10. A. Klaus, M. Sormann, and K. Karner. Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In ICPR '06, pages 15-18, 2006. 2
11. C. Lei, J. Selzer, and Y. Yang. Region-tree based stereo using dynamic programming optimization. In CVPR06, pages II: 2378-2385, 2006. 3
12. S. Mattoccia. A locally global approach to stereo correspondence. In 3DIM2009, pages 1763-1770, Kyoto, Japan, 2009. 1, 2, 3, 4, 5
13. S. Mattoccia. Improving the accuracy of fast dense stereo correspondence algorithms by enforcing local consistency of disparity fields. In 3DPVT2010, Paris, France, 2010. 1, 2, 3, 4, 5, 6, 7, 8
14. S. Mattoccia, S. Giardino, and A. Gambini. Accurate and efficient cost aggregation strategy for stereo correspondence based on approximated joint bilateral filtering. In ACCV2009, Xian, China, 2009. 2
15. OpenMP. The openmp api specification for parallel programming. http://openmp.org/wp/. 5
16. D. Scharstein and R. Szeliski. Middlebury stereo vision. http://vision.middlebury.edu/stereo/. 1, 2, 3, 5, 6
17. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. Jour. Computer Vision, 47(1/2/3):7-42, 2002. 1, 2, 5
18. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans.PAMI, 30(6):1068-1080, 2008. 2
19. Y. Taguchi, B. Wilburn, and C. Zitnick. Stereo reconstruction with mixed pixels using adaptive over-segmentation. In CVPR08, 2008. 2
20. F. Tombari, S. Mattoccia, L. Di Stefano, and E. Addimand a. Classification and evaluation of cost aggregation methods for stereo correspondence. In CVPR08, pages 1-8, 2008. 1, 2
21. O. Veksler. Stereo correspondence by dynamic programming on a tree. In CVPR '05, pages 384-390, 2005. 1, 2, 3
22. W. W. Chen, M. Zhang, and Z. Xiong. Segmentation-based stereo matching with occlusion hand ling via region border constrains. CVIU (submitted), page na, na. 2
23. L. Wang, M. Liao, M. Gong, R. Yang, and D. Nister. Highquality real-time stereo using adaptive cost aggregation and dynamic programming. In 3DPVT '06, pages 798-805, 2006. 1, 2, 3, 6, 7, 8
24. Z.-F.Wang and Z.-G. Zheng. A region based stereo matching algorithm using cooperative optimization. In CVPR, 2008. 2
25. L. Xu and J. Jia. Stereo matching: An outlier confidence approach. In ECCV 2008, pages 775-787, 2008. 2
26. Q. Yang, L. Wang, R. Yang, H. Stewénius, and D. Nistér. Stereo matching with color-weighted correlation, hierarchical belief propagation, and occlusion hand ling. IEEE Trans. PAMI, 31(3):492-504, 2009. 2
27. Q. Yang, R. Yang, J. Davis, and D. Nistér. Spatial-depth super resolution for range images. In Proc. of CVPR2007, pages 1-8, 2007. 2
28. K. Yoon and I. Kweon. Adaptive support-weight approach for correspondence search. IEEE Trans. PAMI, 28(4):650-656, 2006. 2