The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A global matching framework for stereo computation
Abstract
This paper presents a new global matching framework for stereo computation. In this framework, the second view is first predicted from the reference view using the depth information. A global match measure is then defined as the similarity function between the predicted image and the actual image. Stereo computation is converted into a search problem where the goal is to find the depth map that maximizes the global match measure. The major advantage of this framework is that the global visibility constraint is inherently enforced in the computation. This paper explores several key components of this framework including (1) three color segmentation based depth representations, (2) an incremental warping algorithm that dramatically reduces the computational complexity, and (3) scene constraints such as the smoothness constraint and the color similarity constraint. Experimental results using different types of depth representations are presented. The quality of the computed depth maps is demonstrated through image-based rendering from new viewpoints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
A computational theory of human stereo vision
Marr, D., & Poggio, T. (1979) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1979.0029 · Cited by 1,801
Okutomi, M., & Kanade, T. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.206955 · Cited by 939
Structure from stereo-a review
Dhond, U. R., & Aggarwal, J. K. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.44067 · Cited by 867
Robust analysis of feature spaces: color image segmentation
Comaniciu, D., & Meer, P. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1997.609410 · Cited by 683
A maximum-flow formulation of the N-camera stereo correspondence problem
Roy, S., & Cox, I. J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710763 · Cited by 485
Mark, W. R., McMillan, L., & Bishop, G. (1997) · Proceedings of the 1997 symposium on Interactive 3D graphics - SI3D '97 · doi:10.1145/253284.253292 · Cited by 483
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.791245 · Cited by 470
Occlusions and binocular stereo
Geiger, D., Ladendorf, B., & Yuille, A. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55426-2_48 · Cited by 243
Stereo Matching with Nonlinear Diffusion
Scharstein, D., & Szeliski, R. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008015117424 · Cited by 241
A Bayesian approach to binocular steropsis
Belhumeur, P. N. (1996) · International Journal of Computer Vision · doi:10.1007/bf00055146 · Cited by 239
Black, M. J., & Jepson, A. D. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.541407 · Cited by 191
Occlusions and binocular stereo
Geiger, D., Ladendorf, B., & Yuille, A. (1995) · International Journal of Computer Vision · doi:10.1007/bf01679683 · Cited by 169
Direct recovery of shape from multiple views: a parallax based approach
Kumar, R., Anandan, P., & Hanna, K. (2002) · Proceedings of 12th International Conference on Pattern Recognition · doi:10.1109/icpr.1994.576402 · Cited by 163
Self-citationPrediction error as a quality metric for motion and stereo
Szeliski, R. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790301 · Cited by 118
Image-consistent surface triangulation
Morris, D., & Takeo Kanade, A. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2000.855837 · Cited by 102
Stereo matching with non-linear diffusion
Scharstein, D., & Szeliski, R. (1996) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1996.517095 · Cited by 94
Global matching criterion and color segmentation based stereo
Hai, T., & Sawhney, H. (2002) · Proceedings · doi:10.1109/wacv.2000.895429 · Cited by 88
Self-citationCombining stereo and motion analysis for direct estimation of scene structure
Hanna, K., & Okamoto, N. E. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1993.378192 · Cited by 55
Computing Visibility Without Depth
McMillan, L. (1995) · Cited by 40
Multi-view 3D estimation and applications to match move
Sawhney, H., Guo, Y., Asmuth, J. C., & Kumar, R. (2003) · doi:10.1109/mview.1999.781079 · Cited by 17
Self-citation
Cited by
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
High-quality video view interpolation using a layered representation
Zitnick, C. L., Kang, S. B., Uyttendaele, M., Winder, S., & Szeliski, R. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015766 · Cited by 1,385
Stereo matching using belief propagation
Sun, J., Zheng, N.-N., & Shum, H.-Y. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1206509 · Cited by 1,271
Adaptive support-weight approach for correspondence search
Yoon, K.-J., & Kweon, I. S. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.70 · Cited by 1,194
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
Scharstein, D., Szeliski, R., & Zabih, R. (2002) · Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001) · doi:10.1109/smbv.2001.988771 · Cited by 1,084
Metadata
- Authors
- Tao, H., Sawhney, H. S., & Kumar, R.
- Venue
- Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Volume
- 1
- Pages
- 532-539
- OpenAlex
- W2106257280
- Cited by
- 268
- References
- 21
- FWCI
- 13.47
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.