Abstract
A novel algorithm for obtaining accurate dense disparity measurements and precise border localization from stereo pairs is proposed. The algorithm embodies a very effective variable support approach based on segmentation within a Scanline Optimization framework. The use of a variable support allows for precisely retrieving depth discontinuities while smooth surfaces are well recovered thanks to the minimization of a global function along multiple scanlines. Border localization is further enhanced by symmetrically enforcing the geometry of the scene along depth discontinuities. Experimental results show a significant accuracy improvement with respect to comparable stereo matching approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. Jour. Computer Vision 47(1/2/3), 7–42 (2002)
Yoon, K., Kweon, I.: Adaptive support-weight approach for correspondence search. IEEE Trans. PAMI 28(4), 650–656 (2006)
Boykov, Y., Veksler, O., Zabih, R.: A variable window approach to early vision. IEEE Trans. PAMI 20(12), 1283–1294 (1998)
Gong, M., Yang, R.: Image-gradient-guided real-time stereo on graphics hardware. In: Proc. 3D Dig. Imaging and Modeling (3DIM), Ottawa, Canada, pp. 548–555 (2005)
Hirschmuller, H., Innocent, P., Garibaldi, J.: Real-time correlation-based stereo vision with reduced border errors. Int. Jour. Computer Vision 47(1-3) (2002)
Xu, Y., Wang, D., Feng, T., Shum, H.: Stereo computation using radial adaptive windows. In: ICPR 2002. Proc. Int. Conf. on Pattern Recognition, vol. 3, pp. 595–598 (2002)
Gerrits, M., Bekaert, P.: Local stereo matching with segmentation-based outlier rejection. In: CRV 2006. Proc. Canadian Conf. on Computer and Robot Vision, pp. 66–66 (2006)
Wang, L., Gong, M., Gong, M., Yang, R.: How far can we go with local optimization in real-time stereo matching. In: 3DPVT 2006. Proc. Third Int. Symp. on 3D Data Processing, Visualization, and Transmission, pp. 129–136 (2006)
Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. In: ICCV 2001. Proc. Int. Conf. Computer Vision, vol. 2, pp. 508–515 (2001)
Yang, Q.e.a.: Stereo matching with color-weighted correlation, hierachical belief propagation and occlusion handling. In: CVPR 2006. Proc. Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 2347–2354 (2006)
Sun, J., Shum, H., Zheng, N.: Stereo matching using belief propagation. IEEE Trans. PAMI 25(7), 787–800 (2003)
Klaus, A., Sormann, M., Karner, K.: Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In: ICPR 2006. Proc. Int. Conf. on Pattern Recognition, vol. 3, pp. 15–18 (2006)
Bleyer, M., Gelautz, M.: A layered stereo matching algorithm using image segmentation and global visibility constraints. Jour. Photogrammetry and Remote Sensing 59, 128–150 (2005)
Tao, H., Sawheny, H., Kumar, R.: A global matching framework for stereo computation. In: ICCV 2001. Proc. Int. Conf. Computer Vision, vol. 1, pp. 532–539 (2001)
Hirschmuller, H.: Accurate and efficient stereo processing by semi-global matching and mutual information. In: CVPR 2005. Proc. Conf. on Computer Vision and Pattern recognition, vol. 2, pp. 807–814 (2005)
Hirschmuller, H.: Stereo vision in structured environments by consistent semi-global matching. In: CVPR 2006. Proc. Conf. on Computer Vision and Pattern recognition, vol. 2, pp. 2386–2393 (2006)
Gong, M., Yang, Y.: Near real-time reliable stereo matching using programmable graphics hardware. In: CVPR 2005. Proc. Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 924–931 (2005)
Kim, J., Lee, K., Choi, B., Lee, S.: A dense stereo matching using two-pass dynamic programming with generalized ground control points. In: CVPR 2005. Proc. Conf. on Computer Vision and Pattern Recognition, pp. 1075–1082 (2005)
Lei, C., Selzer, J., Yang, Y.: Region-tree based stereo using dynamic programming optimization. In: CVPR 2006. Proc. Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 2378–2385 (2006)
Deng, Y., Lin, X.: A fast line segment based dense stereo algorithm using tree dynamic programming. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, pp. 201–212. Springer, Heidelberg (2006)
Tombari, F., Mattoccia, S., Di Stefano, L.: Segmentation-based adaptive support for accurate stereo correspondence. Technical Report 2007-08-01, Computer Vision Lab, DEIS, University of Bologna, Italy (2007)
Yoon, K., Kweon, I.: Stereo matching with symmetric cost functions. In: CVPR 2006. Proc. Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 2371–2377 (2006)
Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. PAMI 24, 603–619 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mattoccia, S., Tombari, F., Di Stefano, L. (2007). Stereo Vision Enabling Precise Border Localization Within a Scanline Optimization Framework. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds) Computer Vision – ACCV 2007. ACCV 2007. Lecture Notes in Computer Science, vol 4844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76390-1_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-76390-1_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76389-5
Online ISBN: 978-3-540-76390-1
eBook Packages: Computer ScienceComputer Science (R0)