The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Subspace Clustering by Block Diagonal Representation
Open accessAbstract
This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying subspaces. Many subspace clustering methods have been proposed and among which sparse subspace clustering and low-rank representation are two representative ones. Despite the different motivations, we observe that many existing methods own the common block diagonal property, which possibly leads to correct clustering, yet with their proofs given case by case. In this work, we consider a general formulation and provide a unified theoretical guarantee of the block diagonal property. The block diagonal property of many existing methods falls into our special case. Second, we observe that many existing methods approximate the block diagonal representation matrix by using different structure priors, e.g., sparsity and low-rankness, which are indirect. We propose the first block diagonal matrix induced regularizer for directly pursuing the block diagonal matrix. With this regularizer, we solve the subspace clustering problem by Block Diagonal Representation (BDR), which uses the block diagonal structure prior. The BDR model is nonconvex and we propose an alternating minimization solver and prove its convergence. Experiments on real datasets demonstrate the effectiveness of BDR.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
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
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Self-citationSparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250598 · Cited by 3,031
Self-citationAcquiring linear subspaces for face recognition under variable lighting
Lee, K.-C., Ho, J., & Kriegman, D. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.92 · Cited by 2,391
Lambertian reflectance and linear subspaces
Basri, R., & Jacobs, D. W. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177153 · Cited by 1,576
Robust Subspace Segmentation by Low-Rank Representation
Liu, G., Lin, Z., & Yu, Y. H. (2010) · Cited by 1,534
Self-citationGeneralized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.244 · Cited by 1,038
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00196ed1v01y200906aim006 · Cited by 1,022
Object Segmentation by Long Term Analysis of Point Trajectories
Brox, T., & Malik, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_21 · Cited by 744
Robust and Efficient Subspace Segmentation via Least Squares Regression
Lu, C., Min, H., Zhao, Z., Zhu, L., Huang, D.-S., & Yan, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33786-4_26 · Cited by 718
Self-citationLatent Low-Rank Representation for subspace segmentation and feature extraction
Liu, G., & Yan, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126422 · Cited by 679
Self-citationA Multibody Factorization Method for Independently Moving Objects
Costeira, J. P., & Kanade, T. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008000628999 · Cited by 661
A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms
Tron, R., & Vidal, R. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.382974 · Cited by 658
Yan, J., & Pollefeys, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744085_8 · Cited by 489
A geometric analysis of subspace clustering with outliers
Soltanolkotabi, M., & Candés, E. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1034 · Cited by 411
Bradley, P. S., & Mangasarian, O. L. (2000) · Journal of Global Optimization · doi:10.1023/a:1008324625522 · Cited by 396
Scalable 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
Motion segmentation by subspace separation and model selection
Kanatani, K. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937679 · Cited by 349
Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
Lu, C., Tang, J., Yan, S., & Lin, Z. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2511584 · Cited by 307
Self-citationSmooth 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
Self-citationOracle 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
Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
Ma, Y., Yang, A. Y., Derksen, H., & Fossum, R. (2008) · SIAM Review · doi:10.1137/060655523 · Cited by 251
Correlation Adaptive Subspace Segmentation by Trace Lasso
Lu, C., Feng, J., Lin, Z., & Yan, S. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.170 · Cited by 204
Self-citationA Unified Alternating Direction Method of Multipliers by Majorization Minimization
Lu, C., Feng, J., Yan, S., & Lin, Z. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2689021 · Cited by 187
Self-citationStructured Sparse Subspace Clustering: A unified optimization framework
Li, C.-G., & Vidal, R. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298624 · Cited by 186
Multi-Subspace Representation and Discovery
Luo, D., Nie, F., Ding, C. H. Q., & Huang, H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23783-6_26 · Cited by 76
Clustering Partially Observed Graphs via Convex Optimization
Jalali, A., Chen, Y., Sanghavi, S., & Xu, H. (2011) · Cited by 62
Cited by
Tensorized Bipartite Graph Learning for Multi-View Clustering
Xia, W., Gao, Q., Wang, Q., Gao, X., Ding, C., & Tao, D. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3187976 · Cited by 331
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
Metadata
- Authors
- Lu, C., Feng, J., Lin, Z., Mei, T., & Yan, S.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2019-02-01
- Volume
- 41
- Issue
- 2
- Pages
- 487-501
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W2963165461
- Cited by
- 472
- References
- 31
- FWCI
- 23.91
- 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
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.