Abstract
A novel approach to computational binocular stereo based on the Neyman-Pearson criterion for discriminating between statistical hypotheses is proposed. An epipolar terrain profile is reconstructed by maximizing its likelihood ratio with respect to a purely random profile. A simple generative Markov-chain model of an image-driven profile that extends the model of a random profile is introduced. The extended model relates transition probabilities for binocularly and monocularly visible points along the profile to grey level differences between corresponding pixels in mutually adapted stereo images. This allows for regularizing the ill-posed stereo problem with respect to partial occlusions.
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
H. H. Baker: Surfaces from mono and stereo images. Photogrammetria 39 (1984) 217–237. 201
W. Förstner: Image matching. In: R. M. Haralick and L. G. Shapiro: Computer and Robot Vision. Vol. 2, chapter 16. Reading, Addison-Wesley (1993) 289–378.201
G. L. Gimel’farb: Intensity-based computer binocular stereo vision: signal models and algorithms. Int. J. of Imaging Systems and Technology 3 (1991) 189–200. 201, 202, 203, 204
G. L. Gimel’farb: Regularization of low-level binocular stereo vision considering surface smoothness and dissimilarity of superimposed stereo images. In: C. Arcelli, L. P. Cordella, G. Sanniti di Baja (eds.): Aspects of Visual Form Processing. Singapore, World Scientific (1994) 231–240. 202, 203
G. L. Gimel’farb: Symmetric bi-and trinocular stereo: tradeoffs between theoretical foundations and heuristics. Computing Supplement 11 (1996) 53–72. 202, 203
G. Gimel’farb: Stereo terrain reconstruction by dynamic programming. In: B. Jaehne, H. Haussecker, P. Geisser (eds.): Handbook of Computer Vision and Applications 2: Signal Processing and Pattern Recognition. San Diego, Academic Press (1999) 505–530. 201, 202, 203, 204
G. Gimel’farb, H. Li: Probabilistic regularization in symmetric dynamic programming stereo. In: Proc. of the Image and Vision Computing New Zealand’2000 Conf., November 2000, Hamilton, New Zealand. (2000) [to appear]. 202, 205, 208
M. J. Hannah: Digital stereo image matching techniques. Int. Archives on Photogrammetry and Remote Sensing 27 (1988) 280–293. 201
T. Kanade, M. Okutomi: A stereo matching algorithm with an adaptive window: theory and experiment. IEEE Trans. on Pattern Analysis and Machine Intelligence 16 (1994) 920–932. 201
M. G. Kendall, A. Stuart: The Advanced Theory of Statistics. 2: Inference and Relationship. London, Charles Griffin (1967). 202
V. R. Kyreitov: Inverse Problems of Photometry. Novosibirsk, Computing Center of the Siberian Branch of the Academy of Sciences of the USSR (1983) [In Russian]. 201
T. Poggio, V. Torre, C. Koch: Computational vision and regularization theory. Nature 317 (1985) 317–319. 201
G.-Q. Wei, W. Brauer,, G. Hirzinger: Intensity-and gradient-based stereo matching using hierarchical Gaussian basis functions. IEEE Trans. on Pattern Analysis and Machine Intelligence 20 (1998) 1143–1160. 201
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimel’farb, G. (2001). Binocular Stereo by Maximizing the Likelihood Ratio Relative to a Random Terrain. In: Klette, R., Peleg, S., Sommer, G. (eds) Robot Vision. RobVis 2001. Lecture Notes in Computer Science, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44690-7_25
Download citation
DOI: https://doi.org/10.1007/3-540-44690-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41694-4
Online ISBN: 978-3-540-44690-3
eBook Packages: Springer Book Archive