The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
A Comparative Study of Energy Minimization Methods for Markov Random Fields
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
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
Self-citationA 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-citationGrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
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
Self-citationOn the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
Boykov, Y. Y., & Jolly, M.-P. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937505 · Cited by 3,674
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
Self-citationImage quilting for texture synthesis and transfer
Efros, A. A., & Freeman, W. T. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383296 · Cited by 2,347
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
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
Markov Random Field Modeling in Computer Vision
Li, S. Z. (1995) · Computer Science Workbench · doi:10.1007/978-4-431-66933-3 · Cited by 1,276
Graphcut textures: image and video synthesis using graph cuts
Kwatra, V., Schödl, A., Essa, I., Turk, G., & Bobick, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882264 · Cited by 1,216
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015719 · Cited by 1,097
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
Self-citationHeyden, A., Sparr, G., Nielsen, M., & Johansen, P. (2008) · Cited by 1,077
Exact Maximum A Posteriori Estimation for Binary Images
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01764.x · Cited by 1,055
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 918
Interactive digital photomontage
Agarwala, A., Dontcheva, M., Agrawala, M., Drucker, S., Colburn, A., Curless, B., Salesin, D., & Cohen, M. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015718 · Cited by 829
Self-citationMulti-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
Self-citationMultiprocessor Scheduling with the Aid of Network Flow Algorithms
Stone, H. S. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.233840 · Cited by 680
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
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
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
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Weiss, Y., & Freeman, W. T. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910585 · Cited by 581
Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
Weiss, Y., & Freeman, W. T. (2001) · Neural Computation · doi:10.1162/089976601750541769 · Cited by 560
Exact optimization for markov random fields with convex priors
Ishikawa, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233908 · Cited by 486
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
Optimizing Binary MRFs via Extended Roof Duality
Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383203 · Cited by 427
Self-citationMarkov random fields with efficient approximations
Boykov, Y., Veksler, O., & Zabih, R. (2002) · Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231) · doi:10.1109/cvpr.1998.698673 · Cited by 422
Self-citationMinimizing Nonsubmodular Functions with Graph Cuts-A Review
Kolmogorov, V., & Rother, C. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1031 · Cited by 362
Self-citationA Revolution: Belief Propagation in Graphs with Cycles
Frey, B. J., & Mackay, D. (1997) · Cited by 291
Multi-View Stereo via Volumetric Graph-Cuts
Vogiatzis, G., Torr, P. H. S., & Cipolla, R. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.238 · Cited by 275
The theory and practice of Bayesian image labeling
Chou, P. B., & Brown, C. M. (1990) · International Journal of Computer Vision · doi:10.1007/bf00054995 · Cited by 272
Stochastic stereo matching over scale
Barnard, S. T. (1989) · International Journal of Computer Vision · doi:10.1007/bf00054836 · Cited by 242
Approximate Labeling via Graph Cuts Based on Linear Programming
Komodakis, N., & Tziritas, G. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1061 · Cited by 227
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
Kohli, P., & Torr, P. H. S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1128 · Cited by 191
Bi-Layer Segmentation of Binocular Stereo Video
Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., & Rother, C. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.91 · Cited by 189
Self-citationFast, Approximately Optimal Solutions for Single and Dynamic MRFs
Komodakis, N., Tziritas, G., & Paragios, N. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383095 · Cited by 185
Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities
Barbu, A., & Zhu, S.-C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.161 · Cited by 181
Exact voxel occupancy with graph cuts
Snow, D., Viola, P., & Zabih, R. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.855839 · Cited by 174
Self-citationSome Network Flow Problems Solved with Pseudo-Boolean Programming
Ivănescu, P. L. (1965) · Operations Research · doi:10.1287/opre.13.3.388 · Cited by 170
Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2003) · Cited by 167
Agarwala, A., Zheng, K. C., Pal, C., Agrawala, M., Cohen, M., Curless, B., Salesin, D., & Szeliski, R. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073268 · Cited by 164
Self-citationAn efficient algorithm for image segmentation, Markov random fields and related problems
Hochbaum, D. S. (2001) · Journal of the ACM · doi:10.1145/502090.502093 · Cited by 156
Locally adapted hierarchical basis preconditioning
Szeliski, R. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1142005 · Cited by 128
Self-citationTree consistency and bounds on the performance of the max-product algorithm and its generalizations
Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000021412.33763.d5 · Cited by 125
Meltzer, T., Yanover, C., & Weiss, Y. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2005.110 · Cited by 105
Rother, C., Kumar, S., Kolmogorov, V., & Blake, A. (2005) · 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.2005.130 · Cited by 103
Self-citationSurfaces with occlusions from layered stereo
Lin, M. H., & Tomasi, C. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.54 · Cited by 99
Bayesian 3D Modeling from Images Using Multiple Depth Maps
Gargallo, P., & Sturm, P. F. (2005) · 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.2005.84 · Cited by 96
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Veksler, O. (2007) · 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.2007.383249 · Cited by 90
Self-citationProbabilistic 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 86
Self-citationComparison of Energy Minimization Algorithms for Highly Connected Graphs
Kolmogorov, V., & Rother, C. (2006) · Lecture notes in computer science · doi:10.1007/11744047_1 · Cited by 64
Self-citationHamze, F., & de Freitas, N. (2004) · Uncertainty in Artificial Intelligence · doi:10.5555/1036843.1036873 · Cited by 44
Buehler, C., Gortler, S. J., Cohen, M. F., et al. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47977-5_58 · Cited by 30
Cited by
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
Self-citationLearning 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
Self-citation(2008) · Cited by 838
Auto-Context and Its Application to High-Level Vision Tasks and 3D Brain Image Segmentation
Tu, Z., & Bai, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.186 · Cited by 578
Automatic breast ultrasound image segmentation: a survey
Xian, M., Zhang, Y., Cheng, H. D., Xu, F., Zhang, B., & Ding, J. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.02.012 · Cited by 284
“A detailed comparison between ICM and other MRF energy minimization techniques can be found in [35].”
Background
Metadata
- Authors
- Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 16-29
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2140789035
- Cited by
- 386
- References
- 60
- FWCI
- 40.72
- 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.
