Finding the largest unambiguous component of stereo matching
From MaRDI portal
Recommendations
- A progressive scheme for stereo matching
- Stereo matching using belief propagation
- A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
- Symmetric sub-pixel stereo matching
- A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry
Cited in
(9)- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
- Robust correspondence recognition for computer vision
- Feature point matching of curved surface and robust uncertainty
- Stereo matching and occlusion detection with integrity and illusion sensitivity
- Probabilistic regularisation and symmetry in binocular dynamic programming stereo
- Probabilistic signal models to regularise dynamic programming stereo
- An unsupervised stereo matching cost based on sparse representation
- Uncertainty propagation in stereo matching using copulas
- Some deterministic approximations for stochastic stereo matching
This page was built for publication: Finding the largest unambiguous component of stereo matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459579)