The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Abstract
Many real-world problems deal with collections of high-dimensional data, such as images, videos, text, and web documents, DNA microarray data, and more. Often, such high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories to which the data belong. In this paper, we propose and study an algorithm, called sparse subspace clustering, to cluster data points that lie in a union of low-dimensional subspaces. The key idea is that, among the infinitely many possible representations of a data point in terms of other points, a sparse representation corresponds to selecting a few points from the same subspace. This motivates solving a sparse optimization program whose solution is used in a spectral clustering framework to infer the clustering of the data into subspaces. Since solving the sparse optimization program is in general NP-hard, we consider a convex relaxation and show that, under appropriate conditions on the arrangement of the subspaces and the distribution of the data, the proposed minimization program succeeds in recovering the desired sparse representations. The proposed algorithm is efficient and can handle data points near the intersections of subspaces. Another key advantage of the proposed algorithm with respect to the state of the art is that it can deal directly with data nuisances, such as noise, sparse outlying entries, and missing entries, by incorporating the model of the data into the sparse optimization program. We demonstrate the effectiveness of the proposed algorithm through experiments on synthetic data as well as the two real-world problems of motion segmentation and face clustering.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Cited by
iCaRL: Incremental Classifier and Representation Learning
Rebuffi, S.-A., Kolesnikov, A., Sperl, G., & Lampert, C. H. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.587 · Cited by 3,988
Generalized Latent Multi-View Subspace Clustering
Zhang, C., Fu, H., Hu, Q., Cao, X., Xie, Y., Tao, D., & Xu, D. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2877660 · Cited by 739
Going deeper into action recognition: A survey
Herath, S., Harandi, M., & Porikli, F. (2017) · Image and Vision Computing · doi:10.1016/j.imavis.2017.01.010 · Cited by 634
Zero-Shot Learning via Semantic Similarity Embedding
Zhang, Z., & Saligrama, V. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.474 · Cited by 629
Multi-view Subspace Clustering
Gao, H., Nie, F., Li, X., & Huang, H. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.482 · Cited by 614
Segmentation of Moving Objects by Long Term Video Analysis
Ochs, P., Malik, J., & Brox, T. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.242 · Cited by 585
Low-Rank Tensor Constrained Multiview Subspace Clustering
Zhang, C., Fu, H., Liu, S., Liu, G., & Cao, X. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.185 · Cited by 566
Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering
Yang, B., Fu, X., Sidiropoulos, N. D., & Hong, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.04794 · Cited by 565
Big data for cyber physical systems in industry 4.0: a survey
Xu, L. D., & Duan, L. (2019) · Enterprise Information Systems · doi:10.1080/17517575.2018.1442934 · Cited by 526
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
Wang, S., Liu, X., Zhu, X., Zhang, P., Zhang, Y., Gao, F., & Zhu, E. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2021.3131941 · Cited by 517
On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization
Xie, Y., Tao, D., Zhang, W., Liu, Y., Zhang, L., & Qu, Y. (2018) · International Journal of Computer Vision · doi:10.1007/s11263-018-1086-2 · Cited by 506
Multi-view low-rank sparse subspace clustering
Brbić, M., & Kopriva, I. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.08.024 · Cited by 483
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
Self-citationSubspace Clustering by Block Diagonal Representation
Lu, C., Feng, J., Lin, Z., Mei, T., & Yan, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2794348 · Cited by 472
COMPLETER: Incomplete Multi-view Clustering via Contrastive Prediction
Lin, Y., Gou, Y., Liu, Z., Li, B., Lv, J., & Peng, X. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01102 · Cited by 442
Visualizing high-dimensional data: advances in the past decade
Liu, S., Maljovec, D., Wang, B., Bremer, P.-T., & Pascucci, V. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2640960 · Cited by 427
A Survey on Multiview Clustering
Chao, G., Sun, S., & Bi, J. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3065894 · Cited by 427
Consistent and Specific Multi-View Subspace Clustering
Luo, S., Zhang, C., Zhang, W., & Cao, X. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11617 · Cited by 426
Visual SLAM and Structure from Motion in Dynamic Environments: A Survey
Saputra, M. R. U., Markham, A., & Trigoni, N. (2019) · ACM Computing Surveys · doi:10.1145/3177853 · Cited by 398
See all by looking at a few: Sparse modeling for finding representative objects
Elhamifar, E., Sapiro, G., & Vidal, R. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247852 · Cited by 394
Self-citationScalable Sparse Subspace Clustering by Orthogonal Matching Pursuit
You, C., Robinson, D. P., & Vidal, R. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.425 · Cited by 380
Self-citationHierarchical Clustering Multi-Task Learning for Joint Human Action Grouping and Recognition
Liu, A.-A., Su, Y.-T., Nie, W.-Z., & Kankanhalli, M. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2537337 · Cited by 375
Essential Tensor Learning for Multi-View Spectral Clustering
Wu, J., Lin, Z., & Zha, H. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2916740 · Cited by 362
Structured AutoEncoders for Subspace Clustering
Peng, X., Feng, J., Xiao, S., Yau, W.-Y., Zhou, J. T., & Yang, S. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2848470 · Cited by 343
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
He, R., Zheng, W.-S., Tan, T., & Sun, Z. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.102 · Cited by 342
Unified One-Step Multi-View Spectral Clustering
Tang, C., Li, Z., Wang, J., Liu, X., Zhang, W., & Zhu, E. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3172687 · Cited by 318
Transfer adaptation learning: A decade survey
Zhang, L., & Gao, X. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3183326 · Cited by 314
Learning a Joint Affinity Graph for Multiview Subspace Clustering
Tang, C., Zhu, X., Liu, X., Li, M., Wang, P., Zhang, C., & Wang, L. (2019) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2018.2889560 · Cited by 288
Smooth Representation Clustering
Hu, H., Lin, Z., Feng, J., & Zhou, J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.484 · Cited by 286
Multi-representation adaptation network for cross-domain image classification
Zhu, Y., Zhuang, F., Wang, J., Chen, J., Shi, Z., Wu, W., & He, Q. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.07.010 · Cited by 286
Deep Clustering: A Comprehensive Survey
Ren, Y., Pu, J., Yang, Z., Xu, J., Li, G., Pu, X., Yu, P. S., & He, L. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3403155 · Cited by 276
An Efficient Statistical Method for Image Noise Level Estimation
Chen, G., Zhu, F., & Heng, P. A. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.62 · Cited by 267
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
You, C., Li, C.-G., Robinson, D. P., & Vidal, R. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.426 · Cited by 263
Self-citationConstructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
Peng, X., Yu, Z., Yi, Z., & Tang, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536752 · Cited by 257
LSDT: Latent Sparse Domain Transfer Learning for Visual Adaptation
Zhang, L., Zuo, W., & Zhang, D. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2516952 · Cited by 255
On the Applications of Robust PCA in Image and Video Processing
Bouwmans, T., Javed, S., Zhang, H., Lin, Z., & Otazo, R. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2853589 · Cited by 255
A New Subspace Clustering Strategy for AI-Based Data Analysis in IoT System
Cui, Z., Jing, X., Zhao, P., Zhang, W., & Chen, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3056578 · Cited by 254
Stratified Transfer Learning for Cross-domain Activity Recognition
Wang, J., Chen, Y., Hu, L., Peng, X., & Yu, P. S. (2018) · 2018 IEEE International Conference on Pervasive Computing and Communications (PerCom) · doi:10.1109/percom.2018.8444572 · Cited by 253
Incomplete multi-modal representation learning for Alzheimer’s disease diagnosis
Liu, Y., Fan, L., Zhang, C., Zhou, T., Xiao, Z., Geng, L., & Shen, D. (2021) · Medical Image Analysis · doi:10.1016/j.media.2020.101953 · Cited by 102
Thung, K.-H., Yap, P.-T., Adeli, E., Lee, S.-W., & Shen, D. (2018) · Medical Image Analysis · doi:10.1016/j.media.2018.01.002 · Cited by 89
Learning Robot Manipulation Tasks With Task-Parameterized Semitied Hidden Semi-Markov Model
Tanwani, A. K., & Calinon, S. (2016) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2016.2517825 · Cited by 84
Energy-Efficient Multi-Mode Compressed Sensing System for Implantable Neural Recordings
Suo, Y., Zhang, J., Xiong, T., Chin, P. S., Etienne-Cummings, R., & Tran, T. D. (2014) · IEEE Transactions on Biomedical Circuits and Systems · doi:10.1109/tbcas.2014.2359180 · Cited by 47
Exploring Linear Relationship in Feature Map Subspace for ConvNets Compression
Wang, D., Zhou, L., Zhang, X., Bai, X., & Zhou, J. (2018) · arXiv · doi:10.48550/arxiv.1803.05729 · Cited by 42
Metadata
- Authors
- Elhamifar, E., & Vidal, R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2013-11
- Volume
- 35
- Issue
- 11
- Pages
- 2765-2781
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W1993962865
- Cited by
- 3,106
- References
- 53
- FWCI
- 196.93
- 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.