The DOI matches its Crossref record.
Multiclass spectral clustering
Abstract
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigen-decomposition. We clarify the role of eigenvectors as a generator of all optimal solutions through orthonormal transforms. We then solve an optimal discretization problem, which seeks a discrete solution closest to the continuous optima. The discretization is efficiently computed in an iterative fashion using singular value decomposition and nonmaximum suppression. The resulting discrete solutions are nearly global-optimal. Our method is robust to random initialization and converges faster than other clustering methods. Experiments on real image segmentation are reported.
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
Cited by
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
A whole brain fMRI atlas generated via spatially constrained spectral clustering
Craddock, R. C., James, G. A., Holtzheimer, P. E., Hu, X. P., & Mayberg, H. S. (2012) · Human Brain Mapping · doi:10.1002/hbm.21333 · Cited by 1,636
Data Fusion and Multicue Data Matching by Diffusion Maps
Lafon, S., Keller, Y., & Coifman, R. R. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.223 · Cited by 312
Kondo, S., Takahashi, T., Yamagata, N., Imanishi, Y., Katow, H., Hiramatsu, S., Lynn, K., Abe, A., Kumaraswamy, A., & Tanimoto, H. (2020) · Cell Reports · doi:10.1016/j.celrep.2019.12.018 · Cited by 154
SegSort: Segmentation by Discriminative Sorting of Segments
Hwang, J.-J., Yu, S., Shi, J., Collins, M., Yang, T.-J., Zhang, X., & Chen, L.-C. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00743 · Cited by 124
Blind PRNU-Based Image Clustering for Source Identification
Marra, F., Poggi, G., Sansone, C., & Verdoliva, L. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2701335 · Cited by 84
Large-Scale Image Clustering Based on Camera Fingerprints
Lin, X., & Li, C.-T. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2636086 · Cited by 46
Comparison of algorithms for ultrasound image segmentation without ground truth
Sikka, K., & Deserno, T. M. (2010) · SPIE Proceedings · doi:10.1117/12.844504 · Cited by 4
Metadata
- Authors
- Yu, & Shi
- Venue
- Proceedings Ninth IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2003
- Pages
- 313-319 vol.1
- OpenAlex
- W2135674549
- Cited by
- 947
- References
- 0
- FWCI
- 12.03
- 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.
