The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Segmentation given partial grouping constraints
Abstract
We consider data clustering problems where partial grouping is known a priori. We formulate such biased grouping problems as a constrained optimization problem, where structural properties of the data define the goodness of a grouping and partial grouping cues define the feasibility of a grouping. We enforce grouping smoothness and fairness on labeled data points so that sparse partial grouping information can be effectively propagated to the unlabeled data. Considering the normalized cuts criterion in particular, our formulation leads to a constrained eigenvalue problem. By generalizing the Rayleigh-Ritz theorem to projected matrices, we find the global optimum in the relaxed continuous domain by eigendecomposition, from which a near-global optimum to the discrete labeling problem can be obtained effectively. We apply our method to real image segmentation problems, where partial grouping priors can often be derived based on a crude spatial attentional map that binds places with common salient features or focuses on expected object locations. We demonstrate not only that it is possible to integrate both image structures and priors in a single grouping process, but also that objects can be segregated from the background without specific object knowledge.
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
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
Cited by
Yilmaz, A., Javed, O., & Shah, M. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177355 · Cited by 4,792
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
Robust path-based spectral clustering
Chang, H., & Yeung, D.-Y. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.010 · Cited by 565
Nonlocal Linear Image Regularization and Supervised Segmentation
Gilboa, G., & Osher, S. (2007) · Multiscale Modeling & Simulation · doi:10.1137/060669358 · Cited by 468
Content-based image retrieval: approaches and trends of the new age
Datta, R., Li, J., & Wang, J. Z. (2005) · Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval · doi:10.1145/1101826.1101866 · Cited by 435
Metadata
- Authors
- Yu, S. X., & Shi, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-02
- Volume
- 26
- Issue
- 2
- Pages
- 173-183
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2137137397
- Cited by
- 248
- References
- 1
- FWCI
- 15.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Segmentation given partial grouping constraints. https://app.cochat.ai/papers/10.1109/tpami.2004.1262179
- The paper
- Yu, S. X., & Shi, J. (2004). Segmentation given partial grouping constraints. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2004.1262179
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.