Abstract
In stereo matching, homogeneous areas, depth continuity areas, and occluded areas need more attention. Many methods try to handle pixels in homogeneous areas by propagating supports. As a result, pixels in homogeneous areas get assigned disparities inferred from the disparities of neighboring pixels. However, at the same time, pixels in depth discontinuity areas get supports from different depths and/or from occluded pixels, and resultant disparity maps are easy to be blurred.
To resolve this problem, we propose a non-linear diffusion-based support aggregation method. Supports are iteratively aggregated with the support-weights, while adjusting the support-weights according to disparities to prevent incorrect supports from different depths and/or occluded pixels. As a result, the proposed method yields good results not only in homogeneous areas but also in depth discontinuity areas as the iteration goes on without the critical degradation of performance.
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
Baker, S., Sim, T., Kanade, T.: A characterization of inherent stereo ambiguities. In: IEEE International Conference on Computer Vision, July 2001, pp. 428–437 (2001)
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47(1-3), 7–42 (2002)
Kanade, T., Okutomi, M.: A stereo matching algorithm with an adaptive window: theory and experiment. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(9), 920–932 (1994)
Veksler, O.: Stereo correspondence with compact windows via minimum ratio cycle. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(12), 1654–1660 (2002)
Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(4), 650–656 (2006)
Bobick, A.F., Intille, S.S.: Large occlusion stereo. International Journal of Computer Vision 33(3), 181–200 (1999)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Scharstein, D., Szeliski, R.: Stereo matching with nonlinear diffusion. International Journal of Computer Vision 28(2), 155–174 (1998)
Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(7), 787–800 (2003)
Zitnick, C., Kanade, T.: A cooperative algorithm for stereo matching and occlusion detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(7), 675–684 (2000)
Tappen, M.F., Freeman, W.T.: Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters. In: IEEE International Conference on Computer Vision, vol. 2, pp. 900–906 (2003)
Bhat, D.N., Nayar, S.K.: Ordinal measures for image correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(4), 415–423 (1998)
Zabih, R., Woodfill, J.: Non-parametric local transform for computing visual correspondence. In: Eklundh, J.-O. (ed.) ECCV 1994. LNCS, vol. 801, pp. 151–158. Springer, Heidelberg (1994)
Kang, S.B., Szeliski, R., Chai, J.: Handling occlusions in dense multi-view stereo. In: IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 103–110 (2001)
Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. In: IEEE International Conference on Computer Vision, vol. 2, pp. 508–515 (2001)
Yoon, K.J., Kweon, I.S.: Stereo matching with symmetric cost functions. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2371–2377 (2006)
Yoon, K.J., Kweon, I.S.: Stereo matching with the distinctive similarity measure. In: IEEE International Conference on Computer Vision, pp. 1–7 (2007)
Prazdny, K.: Detection of binocular disparities 52, 93–99 (1985)
Hirschmuller, H., Scharstein, D.: Evaluation of cost functions for stereo matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)
Lee, S.H., Kanatsugu, Y., Park, J.I.: Hierarchical stochastic diffusion for disparity estimation. In: IEEE Workshop on Stereo and Multi-Baseline Vision, pp. 111–120 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, KJ., Jeong, Y., Kweon, I.S. (2010). Support Aggregation via Non-linear Diffusion with Disparity-Dependent Support-Weights for Stereo Matching. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12307-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-12307-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12306-1
Online ISBN: 978-3-642-12307-8
eBook Packages: Computer ScienceComputer Science (R0)