The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Graph Cuts in Vision and Graphics: Theories and Applications
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 · cited 2×
“[13, 3]) use standard moves, defined as follows.”
BackgroundFast 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-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
An 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-citation
Cited by
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910
“Boykov and Veksler (2006) discusses some nonregional topological constraints that potentially could be used in the graph cut algorithms for object extrac- tion.”
BackgroundMethodSelf-citationDense image registration through MRFs and efficient linear programming
Glocker, B., Komodakis, N., Tziritas, G., Navab, N., & Paragios, N. (2008) · Medical Image Analysis · doi:10.1016/j.media.2008.03.006 · Cited by 427
Hernando, D., Kellman, P., Haldar, J. P., & Liang, Z. ‐. (2010) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22177 · Cited by 336
Utilizing graph machine learning within drug discovery and development
Gaudelet, T., Day, B., Jamasb, A. R., Soman, J., Regep, C., Liu, G., Hayter, J. B. R., Vickers, R., Roberts, C., Tang, J., et al. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab159 · Cited by 313
Medical image segmentation on GPUs – A comprehensive review
Smistad, E., Falch, T. L., Bozorgi, M., Elster, A. C., & Lindseth, F. (2015) · Medical Image Analysis · doi:10.1016/j.media.2014.10.012 · Cited by 264
Metadata
- Authors
- Boykov, Y., & Veksler, O.
- Venue
- Handbook of Mathematical Models in Computer Vision
- Publisher
- Springer-Verlag
- Published
- 2005-12-31
- Pages
- 79-96
- OpenAlex
- W60423602
- Cited by
- 190
- References
- 4
- FWCI
- 6.62
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph Cuts in Vision and Graphics: Theories and Applications. https://app.cochat.ai/papers/10.1007/0-387-28831-7_5
- The paper
- Boykov, Y., & Veksler, O. (2005). Graph Cuts in Vision and Graphics: Theories and Applications. Handbook of Mathematical Models in Computer Vision. https://doi.org/10.1007/0-387-28831-7_5
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.