The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Evaluation of Cost Functions for Stereo Matching
Abstract
Stereo correspondence methods rely on matching costs for computing the similarity of image locations. In this paper we evaluate the insensitivity of different matching costs with respect to radiometric variations of the input images. We consider both pixel-based and window-based variants and measure their performance in the presence of global intensity changes (e.g., due to gain and exposure differences), local intensity changes (e.g., due to vignetting, non-Lambertian surfaces, and varying lighting), and noise. Using existing stereo datasets with ground-truth disparities as well as six new datasets taken under controlled changes of exposure and lighting, we evaluate the different costs with a local, a semi-global, and a global stereo method.
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 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
Self-citationAn experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Alignment by Maximization of Mutual Information
Viola, P., & Wells III, W. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007958904918 · Cited by 2,610
Non-parametric local transforms for computing visual correspondence
Zabih, R., & Woodfill, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/bfb0028345 · Cited by 1,763
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
Self-citationHigh-accuracy stereo depth maps using structured light
Scharstein, D., & Szeliski, R. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211354 · Cited by 1,542
Self-citationHigh-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
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
Cited by
A Fast Single Image Haze Removal Algorithm Using Color Attenuation Prior
Zhu, Q., Mai, J., & Shao, L. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2446191 · Cited by 2,469
AOD-Net: All-in-One Dehazing Network
Li, B., Peng, X., Wang, Z., Xu, J., & Feng, D. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.511 · Cited by 2,342
Fattal, R. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360671 · Cited by 2,114
Single Image Dehazing via Multi-scale Convolutional Neural Networks
Ren, W., Liu, S., Zhang, H., Pan, J., Cao, X., & Yang, M.-H. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46475-6_10 · Cited by 1,759
End-to-End Learning of Geometry and Context for Deep Stereo Regression
Kendall, A., Martirosyan, H., Dasgupta, S., Henry, P., Kennedy, R., Bachrach, A., & Bry, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.17 · Cited by 1,470
MVSNet: Depth Inference for Unstructured Multi-view Stereo
Yao, Y., Luo, Z., Li, S., Fang, T., & Quan, L. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01237-3_47 · Cited by 1,455
Fattal, R. (2014) · ACM Transactions on Graphics · doi:10.1145/2651362 · Cited by 1,167
Stereo Matching by Training a Convolutional Neural Network to Compare Image Patches
Žbontar, J., & LeCun, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.05970 · Cited by 931
A Multi-view Stereo Benchmark with High-Resolution Images and Multi-camera Videos
Schops, T., Schonberger, J. L., Galliani, S., Sattler, T., Schindler, K., Pollefeys, M., & Geiger, A. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.272 · Cited by 915
Efficient Large-Scale Stereo Matching
Geiger, A., Roser, M., & Urtasun, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19315-6_3 · Cited by 761
Deep learning in optical metrology: a review
Zuo, C., Qian, J., Feng, S., Yin, W., Li, Y., Fan, P., Han, J., Qian, K., & Chen, Q. (2022) · Light: Science & Applications · doi:10.1038/s41377-022-00714-x · Cited by 711
Furukawa, Y., & Hernández, C. (2015) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000052 · Cited by 598
Image Guided Depth Upsampling Using Anisotropic Total Generalized Variation
Ferstl, D., Reinbacher, C., Ranftl, R., Ruether, M., & Bischof, H. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.127 · Cited by 528
Linking Points With Labels in 3D: A Review of Point Cloud Semantic Segmentation
Xie, Y., Tian, J., & Zhu, X. X. (2020) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2019.2937630 · Cited by 482
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
Fattal, R. (2008) · ACM SIGGRAPH 2008 papers · doi:10.1145/1399504.1360671 · Cited by 374
Learning for Disparity Estimation Through Feature Constancy
Liang, Z., Feng, Y., Guo, Y., Liu, H., Chen, W., Qiao, L., Zhou, L., & Zhang, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00297 · Cited by 354
Elharrouss, O., Almaadeed, N., Al-Maadeed, S., & Akbari, Y. (2020) · Neural Processing Letters · doi:10.1007/s11063-019-10163-0 · Cited by 341
Comparative Evaluation of Binary Features
Heinly, J., Dunn, E., & Frahm, J.-M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33709-3_54 · Cited by 331
Constant Time Weighted Median Filtering for Stereo Matching and Beyond
Ma, Z., He, K., Wei, Y., Sun, J., & Wu, E. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.13 · Cited by 292
Robust Stereo Matching Using Adaptive Normalized Cross-Correlation
Heo, Y. S., Lee, K. M., & Lee, S. U. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.136 · Cited by 283
Deep Convolutional Neural Network for Multi-Modal Image Restoration and Fusion
Deng, X., & Dragotti, P. L. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2984244 · Cited by 282
A Real-Time Low-Power Stereo Vision Engine Using Semi-Global Matching
Gehrig, S. K., Eberli, F., & Meyer, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04667-4_14 · Cited by 270
Li, Y., Huang, J.-B., Ahuja, N., & Yang, M.-H. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46493-0_10 · Cited by 269
Furukawa, Y., & Hernández, C. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781601988379 · Cited by 268
A Quantitative Evaluation of Confidence Measures for Stereo Vision
Hu, X., & Mordohai, P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.46 · Cited by 261
Dehazing Evaluation: Real-World Benchmark Datasets, Criteria, and Baselines
Zhao, S., Zhang, L., Huang, S., Shen, Y., & Zhao, S. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.2995264 · Cited by 169
Zhang, J., Cao, Y., Wang, Y., Wen, C., & Chen, C. W. (2018) · Proceedings of the 26th ACM international conference on Multimedia · doi:10.1145/3240508.3240653 · Cited by 40
(2019) · arXiv (Cornell University) · Cited by 16
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
- Hirschmuller, H., & Scharstein, D.
- Venue
- 2007 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2133255058
- Cited by
- 1,122
- References
- 19
- FWCI
- 27.64
- 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.