The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Stereo matching using belief propagation
Abstract
In this paper, we formulate the stereo matching problem as a Markov network and solve it using Bayesian belief propagation. The stereo Markov network consists of three coupled Markov random fields that model the following: a smooth field for depth/disparity, a line process for depth discontinuity, and a binary process for occlusion. After eliminating the line process and the binary process by introducing two robust functions, we apply the belief propagation algorithm to obtain the maximum a posteriori (MAP) estimation in the Markov network. Other low-level visual cues (e.g., image segmentation) can also be easily incorporated in our stereo model to obtain better stereo results. Experiments demonstrate that our methods are comparable to the state-of-the-art stereo algorithms for many test cases.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
(1988) · Cited by 16,582
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
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
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
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
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
Marr, D., & Poggio, T. (1976) · Science · doi:10.1126/science.968482 · Cited by 1,377
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1007/978-1-4899-4485-6 · Cited by 1,151
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
Shade, J., Gortler, S., He, L.-W., & Szeliski, R. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280882 · Cited by 1,115
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
Black, M. J., & Rangarajan, A. (1996) · International Journal of Computer Vision · doi:10.1007/bf00131148 · Cited by 757
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
The variational approach to shape from shading
Horn, B. K. P., & Brooks, M. J. (1986) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(86)90114-3 · Cited by 594
A pixel dissimilarity measure that is insensitive to image sampling
Birchfield, S., & Tomasi, C. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.677269 · Cited by 585
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
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
Bobick, A. F., & Intille, S. S. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008150329890 · Cited by 460
Parallel and deterministic algorithms from MRFs: surface reconstruction
Geiger, D., & Girosi, F. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.134040 · Cited by 447
Depth from edge and intensity based stereo
Baker, H. H., & Binford, T. O. (1981) · Masters Thesis · Cited by 408
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
A global matching framework for stereo computation
Tao, H., Sawhney, H. S., & Kumar, R. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937562 · Cited by 268
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
Occlusions, discontinuities, and epipolar lines in stereo
Ishikawa, H., & Geiger, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055670 · Cited by 190
Occlusions and binocular stereo
Geiger, D., Ladendorf, B., & Yuille, A. (1995) · International Journal of Computer Vision · doi:10.1007/bf01679683 · Cited by 169
Bethe free energy, Kikuchi approximations, and belief propagation algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2001) · Cited by 162
Improvements in real-time correlation-based stereo vision
Hirschmüller, H. (2002) · IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV) · doi:10.1109/smbv.2001.988772 · Cited by 149
Stereo correspondence with compact windows via minimum ratio cycle
Veksler, O. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114859 · Cited by 113
Stereo matching by compact windows via minimum ratio cycle
Veksler, O. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937563 · Cited by 83
Prediction Of Correlation Errors In Stereo-Pair Images
Ryan, T. W., Gray, R. T., & Hunt, B. R. (1980) · Optical Engineering · doi:10.1117/12.7972515 · Cited by 44
Research works printed but not linked: 2
- Bolles, The Jisct Stereo Evaluation
- 10.1007/BF01451740 · doi:10.1007/bf01451740
Cited by
A Database and Evaluation Methodology for Optical Flow
Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., & Szeliski, R. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0390-2 · Cited by 2,205
“A number of recent approaches use discrete optimization algorithms, similar to those employed in stereo matching, such as graph cuts [14] and belief propagation [71].”
MethodAccurate 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
Image Alignment and Stitching: A Tutorial
Szeliski, R. (2007) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000009 · Cited by 1,593
SIFT Flow: Dense Correspondence across Scenes and Its Applications
Liu, C., Yuen, J., & Torralba, A. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.147 · Cited by 1,582
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
Metadata
- Authors
- Sun, J., Zheng, N.-N., & Shum, H.-Y.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2003-07
- Volume
- 25
- Issue
- 7
- Pages
- 787-800
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2151646056
- Cited by
- 1,271
- References
- 36
- FWCI
- 37.52
- 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.