The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Smooth Representation Clustering
Abstract
Subspace clustering is a powerful technology for clustering data according to the underlying subspaces. Representation based methods are the most popular subspace clustering approach in recent years. In this paper, we analyze the grouping effect of representation based methods in depth. In particular, we introduce the enforced grouping effect conditions, which greatly facilitate the analysis of grouping effect. We further find that grouping effect is important for subspace clustering, which should be explicitly enforced in the data self-representation model, rather than implicitly implied by the model as in some prior work. Based on our analysis, we propose the SMooth Representation (SMR) model. We also propose a new affinity measure based on the grouping effect, which proves to be much more effective than the commonly used one. As a result, our SMR significantly outperforms the state-of-the-art ones on benchmark datasets.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
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
Shape and motion from image streams under orthography: a factorization method
Tomasi, C., & Kanade, T. (1992) · International Journal of Computer Vision · doi:10.1007/bf00129684 · Cited by 2,878
A database for handwritten text recognition research
Hull, J. J. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.291440 · Cited by 2,244
Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
Bartels, R. H., & Stewart, G. W. (1972) · Communications of the ACM · doi:10.1145/361573.361582 · Cited by 1,932
Robust Subspace Segmentation by Low-Rank Representation
Liu, G., Lin, Z., & Yu, Y. H. (2010) · Cited by 1,534
Self-citationElhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Generalized 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
A 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
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1085 · Cited by 481
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-citationMulti-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
Cited by
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
Metadata
- Authors
- Hu, H., Lin, Z., Feng, J., & Zhou, J.
- Venue
- 2014 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2014-06
- Pages
- 3834-3841
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2088025572
- Cited by
- 286
- References
- 22
- FWCI
- 13.64
- 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.