The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling
Abstract
In this paper, we formulate a stereo matching algorithm with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matching stereo model based on an energy-minimization framework. The global energy contains two terms, the data term and the smoothness term. The data term is first approximated by a color-weighted correlation, then refined in occluded and low-texture areas in a repeated application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data sets, showing that our algorithm is the top performer among all the algorithms listed there.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
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 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
Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
Hirschmuller, H. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.56 · Cited by 1,698
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
Computing visual correspondence with occlusions using graph cuts
Kolmogorov, V., & Zabih, R. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937668 · Cited by 1,119
A stereo matching algorithm with an adaptive window: theory and experiment
Kanade, T., & Okutomi, M. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.310690 · Cited by 1,068
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
Klaus, A., Sormann, M., & Karner, K. (2006) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2006.1033 · Cited by 837
Cited by
Stereo Processing by Semiglobal Matching and Mutual Information
Hirschmuller, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1166 · Cited by 4,195
Pixelwise View Selection for Unstructured Multi-View Stereo
Schönberger, J. L., Zheng, E., Frahm, J.-M., & Pollefeys, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46487-9_31 · Cited by 2,315
PatchMatch Stereo - Stereo Matching with Slanted Support Windows
Bleyer, M., Rhemann, C., & Rother, C. (2011) · Procedings of the British Machine Vision Conference 2011 · doi:10.5244/c.25.14 · Cited by 736
On building an accurate stereo matching system on graphics hardware
Mei, X., Sun, X., Zhou, M., Jiao, S., Wang, H., & Zhang, X. (2011) · 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops) · doi:10.1109/iccvw.2011.6130280 · Cited by 551
Review of Stereo Vision Algorithms: From Software to Hardware
Lazaros, N., Sirakoulis, G. C., & Gasteratos, A. (2008) · International Journal of Optomechatronics · doi:10.1080/15599610802438680 · Cited by 387
Real-time O(1) bilateral filtering
Yang, Q., Tan, K.-H., & Ahuja, N. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206542 · Cited by 378
Self-citationA non-local cost aggregation method for stereo matching
Yang, Q. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247827 · Cited by 364
Self-citationPractical Stereo Matching via Cascaded Recurrent Network with Adaptive Correlation
Li, J., Wang, P., Xiong, P., Cai, T., Yan, Z., Yang, L., Liu, J., Fan, H., & Liu, S. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01578 · Cited by 345
Accurate Multiple View 3D Reconstruction Using Patch-Based Stereo for Large-Scale Scenes
Shen, S. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2237921 · Cited by 312
Review of stereo vision algorithms and their suitability for resource-limited systems
Tippetts, B., Lee, D. J., Lillywhite, K., & Archibald, J. (2016) · Journal of Real-Time Image Processing · doi:10.1007/s11554-012-0313-2 · Cited by 274
Massively parallel GPU computing for fast stereo correspondence algorithms
Wang, H., Zhang, N., Créput, J.-C., Ruichek, Y., & Moreau, J. (2016) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2016.03.002 · Cited by 4
Metadata
- Authors
- Yang, Q., Wang, L., Yang, R., Stewenius, H., & Nister, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2009-03
- Volume
- 31
- Issue
- 3
- Pages
- 492-504
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2093117706
- Cited by
- 529
- References
- 25
- FWCI
- 61.57
- Type
- journal article
- 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.