Abstract
In stereo matching, global algorithms could produce more accurate disparity estimation than aggregated ones. Unfortunately, they remain facing prohibitively high computational challenges while minimizing an energy function. Although various computationally tractable optimizers such as Belief Propagation (BP), Graph Cut (GC) and Dynamic Programming (DP) exist, they still time-consumed and perform a relative higher energy. On one hand, too many intermediate parameters are required for constructing the energy function. In fact, they are trivial, difficult to compute and inevitably bring noises because of their approximate representations. That signifies a simplified energy function structure with fewer intermediate parameters may not only accelerate the running time but also provide greater result while utilizing same optimizer. On the other hand, optimizers are usually designed artificially and also generate approximate solutions. Based on this observation, a suboptimal energy is probably obtained. To alleviate these limitations, an Accelerating Global Optimization (AGO) stereo matching algorithm is proposed in this paper. Integrating the key ideas of Two-Step Global Optimization (TSGO), the modeled energy function of AGO possesses fewer intermediate parameters. What’s more, a refinement term is augmented into the message passing formula of Sequential Tree-Reweighted (TRW-S) optimizer to lower down the energy. Performance evaluations on Middlebury v.2 & v.3 stereo data sets demonstrate that the proposed AGO outperforms than other five challenging stereo algorithms; and also performs better on Microsoft i2i stereo videos. At last, thanks to the simple energy function model of AGO; it shows a faster execution time.
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), 7–42 (2002)
Gong, M., Yang, R., Wang, L., et al.: A performance study on different cost aggregation approaches used in real-time stereo matching. Int. J. Comput. Vis. 75(2), 283–296 (2007)
Tombari, F., Mattoccia, S., Stefano, L., et al.: Classification and evaluation of cost aggregation methods for stereo correspondence. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2008)
Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Trans. Pattern Anal. 28(4), 650–656 (2006)
Hosni, A., Bleyer, M., Gelautz, M., et al.: Local stereo matching using geodesic support weights. In: IEEE International Conference on Image Processing, pp. 2093–2096 (2009)
He, K., Sun, J., Tang, X.: Guided image filtering. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6311, pp. 1–14. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15549-9_1
Min, D., Lu, J., Do, M.N.: A revisit to cost aggregation in stereo matching: how far can we reduce its computational redundancy? In: IEEE International Conference on Computer Vision, pp. 1567–1574 (2011)
Min, D., Lu, J., Do, M.N.: Joint histogram based cost aggregation for stereo matching. IEEE Trans. Pattern Anal. 35(10), 2539–2545 (2013)
Helala, M.A., Qureshi, F.Z.: Accelerating cost volume filtering using salient subvolumes and robust occlusion handling. In: Cremers, D., Reid, I., Saito, H., Yang, M.-H. (eds.) ACCV 2014. LNCS, vol. 9004, pp. 316–331. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-16808-1_22
Yang, Q.: Local smoothness enforced cost volume regularization for fast stereo correspondence. IEEE Sig. Process. Lett. 22(9), 1429–1433 (2015)
Zhang, K., Fang, Y., Min, D., et al.: Cross-scale cost aggregation for stereo matching. In: IEEE Conference Computer Vision and Pattern Recognition, pp. 407–414 (2014)
Zhang, K., Fang, Y., Min, D., et al.: Cross-scale cost aggregation for stereo matching. IEEE Trans. Circuits Syst. Video Technol. 27(5), 965–976 (2017)
Yang, Q., Wang, L., Yang, R., et al.: Real-time global stereo matching using hierarchical belief propagation. In: British Machine Vision Conference, pp. 989–998 (2006)
Yang, Q., Wang, L., Yang, R., et al.: Stereo matching with color-weighted correlation, hierarchical belief propagation and occlusion handling. IEEE Trans. Pattern Anal. 31(3), 492–504 (2008)
Yang, Q., Wang, L., Ahuja, N.: A constant space belief propagation algorithm for stereo matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1458–1465 (2010)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. 23(11), 1222–1239 (2001)
Taniai, T., Matsushita, Y., Naemura, T.: Graph cut based continuous stereo matching using locally shared labels. In: IEEE Conference on Computer Vision Pattern Recognition, pp. 1613–1620 (2014)
Hirschmuller, H.: Stereo processing by semi-global matching and mutual information. IEEE Trans. Pattern Anal. 30(2), 328–341 (2008)
Zhang, C., Li, Z., Cheng, Y., et al.: MeshStereo: a global stereo model with mesh alignment regularization for view interpolation. In: IEEE International Conference on Computer Vision, pp. 2057–2065 (2015)
Mozerov, M.G., Weijer, J.: Accurate stereo matching by two-step energy minimization. IEEE Trans. Image Process. 24(3), 1153–1163 (2015)
Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. 28(10), 1568–1583 (2006)
Middlebury Online Stereo Evaluation (v.2) (2002). http://vision.middlebury.edu/stereo/eval/
Scharstein, D., Szeliski, R.: Learning conditional random fields for stereo. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)
Hirschmuller, H., Scharstein, D.: Evaluation of cost functions for stereo matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)
Scharstein, D., Hirschmuller, H., Kitajima, Y., et al.: High-resolution stereo datasets with subpixel-accurate ground truth. In: German Conference on Pattern Recognition, pp. 31–42 (2014)
Middlebury Online Stereo Evaluation (v.3) (2014). http://vision.middlebury.edu/stereo/eval3/
Microsoft i2i Stereo Video (2016). http://research.microsoft.com/enus/projects/i2i/data.aspx
Christo, R., Hosni, A., Bleyer, M., et al.: Fast cost-volume filtering for visual correspondence and beyond. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3017–3024 (2011)
Hosni, A., Christo, R., Bleyer, M., et al.: Fast cost-volume filtering for visual correspondence and beyond. IEEE Trans. Pattern Anal. 35(2), 504–511 (2013)
Acknowledgements
This research has been supported by National Natural Science Foundation of China (U1509207, 61325019, 61472278, 61403281 and 61572357).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Yao, P., Zhang, H., Xue, Y., Chen, S. (2018). AGO: Accelerating Global Optimization for Accurate Stereo Matching. In: Schoeffmann, K., et al. MultiMedia Modeling. MMM 2018. Lecture Notes in Computer Science(), vol 10704. Springer, Cham. https://doi.org/10.1007/978-3-319-73603-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-73603-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73602-0
Online ISBN: 978-3-319-73603-7
eBook Packages: Computer ScienceComputer Science (R0)