Abstract
Recently, segment-tree based Non-Local cost aggregation algorithm, which can provide extremely low computational complexity and outstanding performance, has been proposed for stereo matching. The segment-tree (ST) based method integrated the segmentation information with non-local cost aggregation. However, the segmentation method used in the ST method results in under-segmentation so that some of the edges crossing the boundary will be preserved. On the other hand, pixel-level color information can not represent different patterns (smooth regions, texture and boundaries) well. So, only using the color information to establish the weight function is not enough. We proposed a density information based ST for non-local cost aggregation method. The core idea of the algorithm includes: (1) SLIC based method via density information is used to segment image. This clustering feature (density feature) and over-segmentation method are more suitable for stereo matching. (2) In generating sub-MST and linking all the sub-MSTs, we use density information to establish the weight function. We not only consider the color information but also the density information when establishing the weight formula. Performance evaluations on 31 Middlebury stereo pairs show the proposed algorithm outperforms better than other state-of-the-art aggregated based algorithms.
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
References
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comput. Vis. 47(1–3), 7–42 (2002)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: The Proceedings of the Seventh IEEE International Conference on Computer Vision 2002, vol. 1, pp. 377–384 (2002)
Veksler, O.: Stereo correspondence by dynamic programming on a tree. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005. vol. 2, pp. 384–390 (2005)
Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. IEEE Trans. Pattern Anal. Mach. Intell. 25(7), 787–800 (2003)
Yang, Q., Wang, L., Ahuja, N.: A constant-space belief propagation algorithm for stereo matching. In: IEEE Conference on Computer Vision and Pattern Recognition 2010, pp. 1458–1465 (2010)
Hosni, A., Rhemann, C., Bleyer, M., Rother, C., Gelautz, M.: Fast cost-volume filtering for visual correspondence and beyond. IEEE Trans. Pattern Anal. Mach. Intell. 35(2), 504–511 (2001)
Tang, X.: Guided image filtering. IEEE Trans. Pattern Anal. Mach. Intell. 35(6), 1397–1409 (2010)
Yang, Q.: A non-local cost aggregation method for stereo matching. In: Computer Vision and Pattern Recognition 2012, vol. 157, pp. 1402–1409 (2012)
Yang, Q.: Stereo matching using tree filtering. IEEE Trans. Pattern Anal. Mach. Intell. 37(4), 834–846 (2015)
Mei, X., Sun, X., Dong, W., Wang, H., Zhang, X.: Segment-tree based cost aggregation for stereo matching. In: IEEE International Conference on Acoustics, Speech and Signal Processing 2013, vol. 9, pp. 313–320. IEEE (2013)
Yao, P., et al.: Segment-tree based cost aggregation for stereo matching with enhanced segmentation advantage. In: International Conference on Acoustics, Speech and Signal Processing, vol. 10, p. 1109 (2017)
Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. Int. J. Comput. Vis. 59(2), 167–181 (2004)
Rui, L., Fang, L.: Cluster sensing superpixel and grouping. In: Computer Vision and Pattern Recognition Workshops 2016, pp. 1350–1358 (2016)
Scharstein, D., Szeliski, R.: Middlebury stereo evaluation. http://vision.middlebury.edu/stereo/eval/
Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: SLIC superpixels compared to state-of-the-art superpixel methods. IEEE Trans. Pattern Anal. Mach. Intell. 34(11), 2274–2282 (2012)
Yao, P., Zhang, H., Xue, Y., Zhou, M., Xu, G., Gao, Z.: Iterative color-depth MST cost aggregation for stereo matching. In: IEEE International Conference on Multimedia and Expo 2016, pp. 1–6 (2016)
Zhang, K., Fang, Y., Min, D., Sun, L., Yang, S., Yan, S., Tian, Q.: Cross-scale cost aggregation for stereo matching. In: Computer Vision and Pattern Recognition 2014, pp. 1590–1597 (2014)
Acknowledgment
This research has been supported by National Natural Science Foundation of China (U1509207, 6147227, 61572357 and 61872270) .Tianjin Education Committee science and technology development Foundation (No. 2017KJ254).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Du, J., Xue, Y., Zhang, H., Gao, Z. (2018). Stereo Matching Based on Density Segmentation and Non-Local Cost Aggregation. In: Hong, R., Cheng, WH., Yamasaki, T., Wang, M., Ngo, CW. (eds) Advances in Multimedia Information Processing – PCM 2018. PCM 2018. Lecture Notes in Computer Science(), vol 11165. Springer, Cham. https://doi.org/10.1007/978-3-030-00767-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-00767-6_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00766-9
Online ISBN: 978-3-030-00767-6
eBook Packages: Computer ScienceComputer Science (R0)