The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Evaluation of Stereo Matching Costs on Images with Radiometric Differences
Abstract
Stereo correspondence methods rely on matching costs for computing the similarity of image locations. We evaluate the insensitivity of different costs for passive binocular stereo methods with respect to radiometric variations of the input images. We consider both pixel-based and window-based variants like the absolute difference, the sampling-insensitive absolute difference, and normalized cross correlation, as well as their zero-mean versions. We also consider filters like LoG, mean, and bilateral background subtraction (BilSub) and nonparametric measures like Rank, SoftRank, Census, and Ordinal. Finally, hierarchical mutual information (HMI) is considered as pixelwise cost. Using stereo data sets with ground-truth disparities taken under controlled changes of exposure and lighting, we evaluate the costs with a local, a semiglobal, and a global stereo method. We measure the performance of all costs in the presence of simulated and real radiometric differences, including exposure differences, vignetting, varying lighting, and noise. Overall, the ranking of methods across all data sets and experiments appears to be consistent. Among the best costs are BilSub, which performs consistently very well for low radiometric differences; HMI, which is slightly better as pixelwise matching cost in some cases and for strong image noise; and Census, which showed the best and most robust overall performance.
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
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177
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
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
Self-citationWhat 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
High-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
Cited by
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
High-Resolution Stereo Datasets with Subpixel-Accurate Ground Truth
Scharstein, D., Hirschmüller, H., Kitajima, Y., Krathwohl, G., Nešić, N., Wang, X., & Westling, P. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11752-2_3 · Cited by 1,305
Self-citationStereo 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
Computing the stereo matching cost with a convolutional neural network
Zbontar, J., & LeCun, Y. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298767 · Cited by 796
State of the art in high density image matching
Remondino, F., Spera, M. G., Nocerino, E., Menna, F., & Nex, F. (2014) · The Photogrammetric Record · doi:10.1111/phor.12063 · Cited by 628
Furukawa, Y., & Hernández, C. (2015) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000052 · Cited by 598
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
Intel(R) RealSense(TM) Stereoscopic Depth Cameras
Keselman, L., Woodfill, J. I., Grunnet-Jepsen, A., & Bhowmik, A. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2017.167 · Cited by 448
SegStereo: Exploiting Semantic Information for Disparity Estimation
Yang, G., Zhao, H., Shi, J., Deng, Z., & Jia, J. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01234-2_39 · Cited by 375
REMODE: Probabilistic, monocular dense reconstruction in real time
Pizzoli, M., Forster, C., & Scaramuzza, D. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6907233 · Cited by 330
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
Learning Guided Convolutional Network for Depth Completion
Tang, J., Tian, F.-P., Feng, W., Li, J., & Tan, P. (2021) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.3040528 · Cited by 291
Real-Time Self-Adaptive Deep Stereo
Tonioni, A., Tosi, F., Poggi, M., Mattoccia, S., & Stefano, L. D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00028 · Cited by 277
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
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
Embedded Real-time Stereo Estimation via Semi-global Matching on the GPU
Hernandez-Juarez, D., Chacón, A., Espinosa, A., Vázquez, D., Moure, J. C., & López, A. M. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.05.305 · Cited by 165
Steger, C. (2017) · Handbook of Machine and Computer Vision · doi:10.1002/9783527413409.ch9 · Cited by 6
Metadata
- Authors
- Hirschmuller, H., & Scharstein, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2009-09
- Volume
- 31
- Issue
- 9
- Pages
- 1582-1599
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2128357735
- Cited by
- 721
- References
- 35
- FWCI
- 35.32
- 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.