The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Image segmentation with ratio cut
Abstract
This paper proposes a new cost function, cut ratio, for segmenting images using graph-based methods. The cut ratio is defined as the ratio of the corresponding sums of two different weights of edges along the cut boundary and models the mean affinity between the segments separated by the boundary per unit boundary length. This new cost function allows the image perimeter to be segmented, guarantees that the segments produced by bipartitioning are connected, and does not introduce a size, shape, smoothness, or boundary-length bias. The latter allows it to produce segmentations where boundaries are aligned with image edges. Furthermore, the cut-ratio cost function allows efficient iterated region-based segmentation as well as pixel-based segmentation. These properties may be useful for some image-segmentation applications. While the problem of finding a minimum ratio cut in an arbitrary graph is NP-hard, one can find a minimum ratio cut in the connected planar graphs that arise during image segmentation in polynomial time. While the cut ratio, alone, is not sufficient as a baseline method for image segmentation, it forms a good basis for an extended method of image segmentation when combined with a small number of standard techniques. We present an implemented algorithm for finding a minimum ratio cut, prove its correctness, discuss its application to image segmentation, and present the results of segmenting a number of medical and natural images using our techniques.
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
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
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Wu, Z., & Leahy, R. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.244673 · Cited by 1,137
Contour and Texture Analysis for Image Segmentation
Malik, J., Belongie, S., Leung, T., & Shi, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011174803800 · Cited by 1,089
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609407 · Cited by 849
LEDA: A platform for combinatorial and geometric computing
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90217-7 · Cited by 489
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Aumann, Y., & Rabani, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794285983 · Cited by 260
Fast multiscale image segmentation
Sharon, E., Brandt, A., & Basri, R. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.855801 · Cited by 253
Computing Minimum-Weight Perfect Matchings
Cook, W., & Rohe, A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.2.138 · Cited by 249
Sarkar, S., & Soundararajan, P. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.857006 · Cited by 198
Globally optimal regions and boundaries as minimum ratio weight cycles
Jermyn, I. H., & Ishikawa, H. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954599 · Cited by 168
"Ratio regions": a technique for image segmentation
Cox, I. J., Rao, S. B., & Zhong, Y. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546886 · Cited by 152
Segmentation and boundary detection using multiscale intensity measurements
Sharon, E., Brandt, A., & Basri, R. (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.2001.990512 · Cited by 114
A scaling algorithm for weighted matching on general graphs
Gabow, H. N. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.3 · Cited by 108
Image segmentation by nested cuts
Veksler, O. (2002) · 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.2000.855838 · Cited by 82
Image segmentation with minimum mean cut
Wang, S., & Siskind, J. M. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937560 · Cited by 66
Self-citationGlobally optimal regions and boundaries
Jermyn, I. H., & Ishikawa, H. (1999) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1999.790318 · Cited by 47
Cited by
TurboPixels: Fast Superpixels Using Geometric Flows
Levinshtein, A., Stere, A., Kutulakos, K. N., Fleet, D. J., Dickinson, S. J., & Siddiqi, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.96 · Cited by 1,146
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Li, K., Wu, X., Chen, D. Z., & Sonka, M. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.19 · Cited by 664
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
The Oxford Handbook of Perceptual Organization
(2015) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780199686858.001.0001 · Cited by 463
Constrained parametric min-cuts for automatic object segmentation
Carreira, J., & Sminchisescu, C. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540063 · Cited by 420
Metadata
- Authors
- Wang, S., & Siskind, J. M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2003-06
- Volume
- 25
- Issue
- 6
- Pages
- 675-690-4
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2109407305
- Cited by
- 293
- References
- 21
- FWCI
- 11.29
- Type
- journal article
- 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.