Finding the Largest Unambiguous Component of Stereo Matching
- 29 April 2002
- book chapter
- Published by Springer Nature
- p. 900-914
- https://doi.org/10.1007/3-540-47977-5_59
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The Trinocular General Support Algorithm: A Three-camera Stereo Algorithm For Overcoming Binocular Matching ErrorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Disparity component matching for visual correspondencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A characterization of inherent stereo ambiguitiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A cooperative algorithm for stereo matching and occlusion detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- A Theory of Shape by Space CarvingInternational Journal of Computer Vision, 2000
- Large Occlusion StereoInternational Journal of Computer Vision, 1999
- Stereo Matching with Nonlinear DiffusionInternational Journal of Computer Vision, 1998
- A Bayesian approach to binocular steropsisInternational Journal of Computer Vision, 1996
- Stochastic stereo matching over scaleInternational Journal of Computer Vision, 1989
- PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient LimitPerception, 1985