The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Graph cut based image segmentation with connectivity priors
Abstract
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated objects due to the ldquoshrinking biasrdquo. To overcome this problem, we propose to impose an additional connectivity prior, which is a very natural assumption about objects. We formulate several versions of the connectivity constraint and show that the corresponding optimization problems are all NP-hard. For some of these versions we propose two optimization algorithms: (i) a practical heuristic technique which we call DijkstraGC, and (ii) a slow method based on problem decomposition which provides a lower bound on the problem. We use the second technique to verify that for some practical examples DijkstraGC is able to find the global minimum.
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
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
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
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-citationMedical image analysis: progress over two decades and the challenges ahead
Duncan, J. S., & Ayache, N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824822 · Cited by 4,140
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
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
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Cited by
Salient Object Detection: A Discriminative Regional Feature Integration Approach
Jiang, H., Wang, J., Yuan, Z., Wu, Y., Zheng, N., & Li, S. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.271 · Cited by 1,147
Geodesic Saliency Using Background Priors
Wei, Y., Wen, F., Zhu, W., & Sun, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33712-3_3 · Cited by 842
Segmentation Propagation in ImageNet
Kuettel, D., Guillaumin, M., & Ferrari, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33786-4_34 · Cited by 597
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
Carreira, J., & Sminchisescu, C. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.231 · Cited by 592
associated_data_Investigating the Effectiveness of clDice Loss for Road Crack Segmentation
Pereira, V. (2025) · arXiv (Cornell University) · doi:10.5281/zenodo.15696262 · Cited by 548
Automatic salient object segmentation based on context and shape prior
Jiang, H., Wang, J., Yuan, Z., Liu, T., & Zheng, N. (2011) · Procedings of the British Machine Vision Conference 2011 · doi:10.5244/c.25.110 · Cited by 450
Geodesic star convexity for interactive image segmentation
Gulshan, V., Rother, C., Criminisi, A., Blake, A., & Zisserman, A. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540073 · Cited by 403
Self-citationImage segmentation with a bounding box prior
Lempitsky, V., Kohli, P., Rother, C., & Sharp, T. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459262 · Cited by 390
Self-citationPower Watershed: A Unifying Graph-Based Optimization Framework
Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.200 · Cited by 305
Star Shape Prior for Graph-Cut Image Segmentation
Veksler, O. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_34 · Cited by 287
Transformation of General Binary MRF Minimization to the First-Order Case
Ishikawa, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.91 · Cited by 144
SuRVoS: Super-Region Volume Segmentation workbench
Luengo, I., Darrow, M. C., Spink, M. C., Sun, Y., Dai, W., He, C. Y., Chiu, W., Pridmore, T., Ashton, A. W., Duke, E. M. H., et al. (2017) · Journal of Structural Biology · doi:10.1016/j.jsb.2017.02.007 · Cited by 89
Deep Interactive Thin Object Selection
Liew, J. H., Cohen, S., Price, B., Mai, L., & Feng, J. (2021) · 2021 IEEE Winter Conference on Applications of Computer Vision (WACV) · doi:10.1109/wacv48630.2021.00035 · Cited by 48
clDice - a Novel Topology-Preserving Loss Function for Tubular Structure Segmentation
Shit, S., Paetzold, J. C., Sekuboyina, A., Ezhov, I., Unger, A., Zhylka, A., Pluim, J. P. W., Bauer, U., & Menze, B. H. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01629 · Cited by 60
“For non-binary geometries, existing methods applied topology and connectivity constraints onto variational and Markov random field-based methods: tree shape priors for vessel segmentation [44], graph representation priors to natural images [2], higher-order cliques which connect superpixels [53] and adversarial learni…”
Method
Metadata
- Authors
- Vicente, S., Kolmogorov, V., & Rother, C.
- Venue
- 2008 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2147899407
- Cited by
- 385
- References
- 28
- FWCI
- 21.10
- 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.