The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Learning Conditional Random Fields for Stereo
Abstract
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for example by modulating local smoothness costs with intensity gradients. In this paper we seek to replace such heuristics with explicit probabilistic models of disparities and intensities learned from real images. We have constructed a large number of stereo datasets with ground-truth disparities, and we use a subset of these datasets to learn the parameters of conditional random fields (CRFs). We present experimental results illustrating the potential of our approach for automatically learning the parameters of models with richer structure than standard hand-tuned MRF models.
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
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-citationFactor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“Figure 1 illustrates the factorization we use for our models using a factor graph [30].”
MethodAn Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
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
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
(2001) · Cited by 1,932
Collins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
Probabilistic Networks and Expert Systems
(1999) · Information Science and Statistics · doi:10.1007/b97670 · Cited by 1,727
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-citationLoopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
High-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
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
Understanding belief propagation and its generalizations
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003) · Cited by 1,288
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
Shallow parsing with conditional random fields
Sha, F., & Pereira, F. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073473 · Cited by 1,246
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
Convergent Tree-Reweighted Message Passing for Energy Minimization
Kolmogorov, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.200 · Cited by 1,095
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
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
Self-citationAn Introduction to Conditional Random Fields for Relational Learning
Sutton, C., & McCallum, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0006 · Cited by 841
Multiscale conditional random fields for image labeling
He, X., Zemel, R. S., & Carreira-Perpinan, M. A. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315232 · Cited by 828
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
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 654
(2005) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/1046920.1088695 · Cited by 650
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
Interactive Image Segmentation Using an Adaptive GMMRF Model
Blake, A., Rother, C., Brown, M., Perez, P., & Torr, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24670-1_33 · Cited by 527
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
Symmetric Stereo Matching for Occlusion Handling
Sun, J., Li, Y., Kang, S. B., & Shum, H.-Y. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.337 · Cited by 415
Kumar, S., & Hebert, M. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7007-9 · Cited by 392
A 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
Self-citationSegment-based stereo matching using graph cuts
Hong, L., & Chen, G. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315016 · Cited by 329
A Revolution: Belief Propagation in Graphs with Cycles
Frey, B. J., & Mackay, D. (1997) · Cited by 291
Sutton, C., Rohanimanesh, K., & McCallum, A. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015422 · Cited by 284
Accelerated training of conditional random fields with stochastic gradient methods
Vishwanathan, S. V. N., Schraudolph, N. N., Schmidt, M. W., & Murphy, K. P. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143966 · Cited by 278
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
Stochastic stereo matching over scale
Barnard, S. T. (1989) · International Journal of Computer Vision · doi:10.1007/bf00054836 · Cited by 242
Tree-based reparameterization framework for analysis of sum-product and related algorithms
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810642 · Cited by 232
Alvarez, L., Deriche, R., Sánchez, J., & Weickert, J. (2002) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.2001.0482 · Cited by 197
Yang, Q., Wang, L., Yang, R., Stewenius, H., & Nister, D. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.292 · Cited by 181
A comparison of algorithms for inference and learning in probabilistic graphical models
Frey, B. J., & Jojic, N. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.169 · Cited by 173
Dense matching of multiple wide-baseline views
Strecha, Tuytelaars, T., & Gool, V. (2003) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2003.1238627 · Cited by 159
Wide-baseline stereo from multiple views: a probabilistic account
Strecha, C., Fransens, R., & Gool, L. V. (2004) · 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.2004.1315080 · Cited by 131
An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators
Liang, P., & Jordan, M. I. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390230 · Cited by 119
A layered stereo algorithm using image segmentation and global visibility constraints
Bleyer, M., & Gelautz, M. (2005) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2004.1421743 · Cited by 115
Region-based progressive stereo matching
Wei, Y., & Quan, L. (2004) · 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.2004.1315020 · Cited by 107
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
Zhang, L., & Seitz, S. M. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.36 · Cited by 95
Probabilistic fusion of stereo with color and contrast for bilayer segmentation
Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., & Pother, C. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.193 · Cited by 94
Stereo Matching with Segmentation-Based Cooperation
Zhang, Y., & Kambhamettu, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47967-8_37 · Cited by 55
Pal, C., Sutton, C. A., & McCallum, A. (2006) · doi:10.1109/icassp.2006.1661342 · Cited by 55
Self-citationSign detection in natural images with conditional random fields
Weinman, J. J., Hanson, A., & McCallum, A. (2005) · Machine learning for signal processing ... · doi:10.1109/mlsp.2004.1423018 · Cited by 34
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
Weinman, J. J., Tran, L., & Pal, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88682-2_47 · Cited by 14
Self-citationSpatiotemporal power spectra of motion parallax: the case of cluttered 3D scenes
Rivait, D., & Langer, M. (2007) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.698163 · Cited by 3
Cited by
DehazeNet: An End-to-End System for Single Image Haze Removal
Cai, B., Xu, X., Jia, K., Qing, C., & Tao, D. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2598681 · Cited by 3,367
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
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
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
Metadata
- Authors
- Scharstein, D., & Pal, C.
- Venue
- 2007 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2099712288
- Cited by
- 851
- References
- 55
- FWCI
- 16.42
- 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.