The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Globally optimal regions and boundaries as minimum ratio weight cycles
Open accessAbstract
We describe a new form of energy functional for the modeling and identification of regions in images. The energy is defined on the space of boundaries in the image domain and can incorporate very general combinations of modeling information both from the boundary (intensity gradients, etc.) and from the interior of the region (texture, homogeneity, etc.). We describe two polynomial-time digraph algorithms for finding the global minima of this energy. One of the algorithms is completely general, minimizing the functional for any choice of modeling information. It runs in a few seconds on a 256/spl times/256 image. The other algorithm applies to a subclass of functionals, but has the advantage of being extremely parallelizable. Neither algorithm requires initialization.
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
Stochastic completion fields: A neural model of illusory contour shape and salience.
Williams, L. R., & Jacobs, D. W. (1997) · Neural Computation · doi:10.1162/neco.1997.9.4.837 · Cited by 331
Cited by
Recovering Occlusion Boundaries from a Single Image
Hoiem, D., Stein, A. N., Efros, A. A., & Hebert, M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408985 · Cited by 206
Metadata
- Authors
- Jermyn, I. H., & Ishikawa, H.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2001
- Volume
- 23
- Issue
- 10
- Pages
- 1075-1088
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2117740473
- Cited by
- 168
- References
- 1
- FWCI
- 6.35
- Type
- journal article
- Language
- en
- Open access
- green
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: Globally optimal regions and boundaries as minimum ratio weight cycles. https://app.cochat.ai/papers/10.1109/34.954599
- The paper
- Jermyn, I. H., & Ishikawa, H. (2001). Globally optimal regions and boundaries as minimum ratio weight cycles. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.954599
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.
