Abstract
In this paper, we present a novel method for improving the speed and accuracy of the initial disparity estimation of the stereo matching algorithms. These algorithms are widely investigated, but fast and precise estimation of a disparity map still remains a challenging problem. Recent top ranking stereo matching algorithms usually utilize a window-based approach and mean shift based clustering. We propose an algorithm inspired by a top-down approach exploiting these two steps.
By using the mean shift algorithm, we transform the input images into the attractor space and then perform the matching on the attractor sets. In contrast to the state-of-the-art algorithms, where matching is done on the basis of pixel intensities, grouped according to the results of mean shift algorithm, we perform the matching between the attractor sets of both input images. In this way we are able to acquire fast disparity estimates for whole segments.
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
Cyganek, B.: An Introduction to 3D Computer Vision Techniques and Algorithms. John Wiley & Sons, Chichester (2007)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47, 7–42 (2002)
Klaus, A., Sormann, M., Karner, K.F.: Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In: ICPR, vol. (3), pp. 15–18. IEEE Computer Society, Los Alamitos (2006)
Wang, Z.F., Zheng, Z.G.: A region based stereo matching algorithm using cooperative optimization. In: CVPR. IEEE Computer Society, Los Alamitos (2008)
Bleyer, M., Gelautz, M.: A layered stereo algorithm using image segmentation and global visibility constraints. In: ICIP, pp. 2997–3000 (2004)
Tombari, F., Mattoccia, S., di Stefano, L.: Segmentation-based adaptive support for accurate stereo correspondence. In: Mery, D., Rueda, L. (eds.) PSIVT 2007. LNCS, vol. 4872, pp. 427–438. Springer, Heidelberg (2007)
Hosni, A., Bleyer, M., Gelautz, M., Rhemann, C.: Local stereo matching using geodesic support weights. In: Submitted to IEEE International Conference on Image Processing, ICIP (2009)
Yang, Q., Engels, C., Akbarzadeh, A.: Near real-time stereo for weakly-textured scenes. In: British Machine Vision Conference, BMVC (2008)
Comaniciu, D., Meer, P., Member, S.: Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 603–619 (2002)
Fukunaga, K., Hostetler, L.: The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory 21, 32–40 (1975)
Cheng, Y.: Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Anal. Mach. Intell. 17, 790–799 (1995)
Stefano, L.D., Marchionni, M., Mattoccia, S., Neri, G.: A fast area-based stereo matching algorithm. Image and Vision Computing 22, 983–1005 (2002)
Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2003), Madison, WI, USA, pp. 195–202 (2003)
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
Krumnikl, M. (2010). Stereo Matching in Mean Shift Attractor Space. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2010. Lecture Notes in Computer Science, vol 6455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17277-9_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-17277-9_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17276-2
Online ISBN: 978-3-642-17277-9
eBook Packages: Computer ScienceComputer Science (R0)