Abstract
This chapter discusses the search for corresponding pixels in a pair of stereo images. We consider at first correspondence search as a labelling problem, defined by data and smoothness error functions, but also by the applied control structure. We describe belief-propagation stereo and semi-global matching. Finally we also discuss how to evaluate the accuracy of stereo-matching results on real-world input data, particularly on stereo video data.
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
Notes
- 1.
This notation is short for \(W_{p}^{2l+1,2k+1}(I)\), the notation used in Sect. 1.1.1.
- 2.
See [H.S. Warren. Hacker’s Delight, pp. 65–72, Addison-Wesley Longman, New York, 2002].
- 3.
Published in [S. Hermann and R. Klette. Iterative semi-global matching for robust driver assistance systems. In Proc. Asian Conf. Computer Vision 2012, LNCS 7726, pp. 465–478, 2012]; this stereo matcher was awarded the Robust Vision Challenge at the European Conference on Computer Vision in 2012.
- 4.
See [S. Morales and R. Klette. A third eye for performance evaluation in stereo sequence analysis. In Proc. Computer Analysis Images Patterns, LNCS 5702, pp. 1078–1086, 2009].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Klette, R. (2014). Stereo Matching. In: Concise Computer Vision. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-6320-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6320-6_8
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6319-0
Online ISBN: 978-1-4471-6320-6
eBook Packages: Computer ScienceComputer Science (R0)