The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A pixel dissimilarity measure that is insensitive to image sampling
Abstract
Because of image sampling, traditional measures of pixel dissimilarity can assign a large value to two corresponding pixels in a stereo pair, even in the absence of noise and other degrading effects. We propose a measure of dissimilarity that is provably insensitive to sampling because it uses the linearly interpolated intensity functions surrounding the pixels. Experiments on real images show that our measure alleviates the problem of sampling with little additional computational overhead.
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
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
A Maximum Likelihood Stereo Algorithm
Cox, I. J., Hingorani, S. L., Rao, S. B., & Maggs, B. M. (1996) · Computer Vision and Image Understanding · doi:10.1006/cviu.1996.0040 · Cited by 470
Depth Discontinuities by Pixel-to-Pixel Stereo
Birchfield, S., & Tomasi, C. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008160311296 · Cited by 417
Self-citationOcclusions 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
Depth discontinuities by pixel-to-pixel stereo
Birchfield, S. T., & Tomasi, C. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710850 · Cited by 228
Self-citationPractical Real-Time Imaging Stereo Matcher
Nishihara, H. K. (1984) · Optical Engineering · doi:10.1117/12.7973334 · Cited by 209
Disparity-space images and large occlusion stereo
Intille, S. S., & Bobick, A. F. (1994) · Lecture Notes in Computer Science · doi:10.1007/bfb0028349 · Cited by 169
Occlusions and binocular stereo
Geiger, D., Ladendorf, B., & Yuille, A. (1995) · International Journal of Computer Vision · doi:10.1007/bf01679683 · Cited by 169
A Bayesian treatment of the stereo correspondence problem using half-occluded regions
Belhumeur, P. N., & Mumford, D. (2003) · 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.1992.223143 · Cited by 155
Matching images by comparing their gradient fields
Scharstein, D. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1994.576363 · Cited by 95
Cited by
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
“Recent approaches have focused on the dense (intensitybased) scanline optimization problem [6, 30, 22, 14, 9].”
BackgroundDAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo
Tola, E., Lepetit, V., & Fua, P. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.77 · Cited by 1,405
Efficient Belief Propagation for Early Vision
Felzenszwalb, P. F., & Huttenlocher, D. P. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7899-4 · Cited by 1,345
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
Evaluation of Cost Functions for Stereo Matching
Hirschmuller, H., & Scharstein, D. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383248 · Cited by 1,122
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 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
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70844 · Cited by 966
Learning Conditional Random Fields for Stereo
Scharstein, D., & Pal, C. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383191 · Cited by 851
Spatial-Depth Super Resolution for Range Images
Yang, Q., Yang, R., Davis, J., & Nister, D. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383211 · Cited by 745
Multi-camera Scene Reconstruction via Graph Cuts
Kolmogorov, V., & Zabih, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47977-5_6 · Cited by 739
Evaluation of Stereo Matching Costs on Images with Radiometric Differences
Hirschmuller, H., & Scharstein, D. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.221 · Cited by 721
Furukawa, Y., & Hernández, C. (2015) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000052 · Cited by 598
Yang, Q., Wang, L., Yang, R., Stewenius, H., & Nister, D. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.99 · Cited by 529
Cascade Residual Learning: A Two-Stage Convolutional Neural Network for Stereo Matching
Pang, J., Sun, W., Ren, J. S., Yang, C., & Yan, Q. (2017) · 2017 IEEE International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw.2017.108 · Cited by 491
A fast local descriptor for dense matching
Tola, E., Lepetit, V., & Fua, P. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587673 · Cited by 480
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
Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters
Tappen, & Freeman (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238444 · Cited by 451
Efficient belief propagation for early vision
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315041 · Cited by 442
Depth Discontinuities by Pixel-to-Pixel Stereo
Birchfield, S., & Tomasi, C. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008160311296 · Cited by 417
Self-citationA Comparative Study of Energy Minimization Methods for Markov Random Fields
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744047_2 · Cited by 386
Handling occlusions in dense multi-view stereo
Kang, S. B., Szeliski, R., & Chai, J. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990462 · Cited by 353
Stereo Matching Using Belief Propagation
Sun, J., Shum, H.-Y., & Zheng, N.-N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47967-8_34 · Cited by 296
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
Furukawa, Y., & Hernández, C. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781601988379 · Cited by 268
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
Bayesian Fusion Inspired 3D Reconstruction via LiDAR-Stereo Camera Pair
Kim, I., & Singh, S. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-47966-3_23 · Cited by 2
Metadata
- Authors
- Birchfield, S., & Tomasi, C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1998-04
- Volume
- 20
- Issue
- 4
- Pages
- 401-406
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2137017911
- Cited by
- 585
- References
- 10
- FWCI
- 4.65
- 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.