The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Geodesic graph cut for interactive image segmentation
Abstract
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seeds, such as the recent geodesic segmentation approach, avoid the boundary-length bias of graph-cut methods but have their own bias towards minimizing paths to the seeds, resulting in increased sensitivity to seed placement. The lack of edge modeling in geodesic or similar approaches limits their ability to precisely localize object boundaries, something at which graph-cut methods generally excel. This paper presents a method for combining geodesic-distance information with edge information in a graphcut optimization framework, leveraging the complementary strengths of each. Rather than a fixed combination we use the distinctiveness of the foreground/background color models to predict the effectiveness of the geodesic distance term and adjust the weighting accordingly. We also introduce a spatially varying weighting that decreases the potential for shortcutting in object interiors while transferring greater control to the edge term for better localization near object boundaries. Results show our method is less prone to shortcutting than typical graph cut methods while being less sensitive to seed placement and better at edge localization than geodesic methods. This leads to increased segmentation accuracy and reduced effort on the part of the user.
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
GrabCut: 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
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
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
A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408931 · Cited by 438
Interactive segmentation of image volumes with Live Surface
Armstrong, C. J., Price, B. L., & Barrett, W. A. (2007) · Computers & Graphics · doi:10.1016/j.cag.2006.11.015 · Cited by 53
Self-citation
Cited by
Ilastik: Interactive learning and segmentation toolkit
Sommer, C., Straehle, C., Kothe, U., & Hamprecht, F. A. (2011) · 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro · doi:10.1109/isbi.2011.5872394 · Cited by 1,125
Saliency-aware geodesic video object segmentation
Wang, W., Shen, J., & Porikli, F. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298961 · Cited by 524
Saliency-Aware Video Object Segmentation
Wang, W., Shen, J., Yang, R., & Porikli, F. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2662005 · Cited by 472
Deep Interactive Object Selection
Xu, N., Price, B., Cohen, S., Yang, J., & Huang, T. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.47 · Cited by 460
Self-citationDeepCut: Object Segmentation From Bounding Box Annotations Using Convolutional Neural Networks
Rajchl, M., Lee, M. C. H., Oktay, O., Kamnitsas, K., Passerat-Palmbach, J., Bai, W., Damodaram, M., Rutherford, M. A., Hajnal, J. V., Kainz, B., et al. (2017) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2016.2621185 · Cited by 410
Metadata
- Authors
- Price, B. L., Morse, B., & Cohen, S.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 3161-3168
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2167388493
- Cited by
- 181
- References
- 5
- FWCI
- 10.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geodesic graph cut for interactive image segmentation. https://app.cochat.ai/papers/10.1109/cvpr.2010.5540079
- The paper
- Price, B. L., Morse, B., & Cohen, S. (2010). Geodesic graph cut for interactive image segmentation. 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. https://doi.org/10.1109/cvpr.2010.5540079
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.