The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Generalized principal component analysis (GPCA)
Abstract
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represent the subspaces with a set of homogeneous polynomials whose degree is the number of subspaces and whose derivatives at a data point give normal vectors to the subspace passing through the point. When the number of subspaces is known, we show that these polynomials can be estimated linearly from data; hence, subspace segmentation is reduced to classifying one point per subspace. We select these points optimally from the data set by minimizing certain distance function, thus dealing automatically with moderate noise in the data. A basis for the complement of each subspace is then recovered by applying standard PCA to the collection of derivatives (normal vectors). Extensions of GPCA that deal with data in a high-dimensional space and with an unknown number of subspaces are also presented. Our experiments on low-dimensional data show that GPCA outperforms existing algebraic algorithms based on polynomial factorization and provides a good initialization to iterative techniques such as K-subspaces and Expectation Maximization. We also present applications of GPCA to computer vision problems such as face clustering, temporal video segmentation, and 3D motion segmentation from point correspondences in multiple affine views.
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
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Hartshorne, R. (1977) · Graduate texts in mathematics · doi:10.1007/978-1-4757-3849-0 · Cited by 6,960
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Probabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679
Hirsch, M. W. (1976) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-9449-5 · Cited by 2,520
Discriminants, Resultants, and Multidimensional Determinants
Gelfand, I. M., Kapranov, M. M., & Zelevinsky, A. V. (1994) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4771-1 · Cited by 2,306
Mixtures of Probabilistic Principal Component Analyzers
Tipping, M. E., & Bishop, C. M. (1999) · Neural Computation · doi:10.1162/089976699300016728 · Cited by 1,873
Algebraic geometry: a first course
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5053a · Cited by 998
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
Harris, J. (1992) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2189-8 · Cited by 580
Clustering appearances of objects under varying illumination conditions
Ho, J., Yang, M.-H., Lim, J., Lee, K.-C., & Kriegman, D. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211332 · Cited by 521
Probability and Random Processes with Applications to Signal Processing
Stark, H., & Woods, J. W. (2001) · Medical Entomology and Zoology · Cited by 437
A Generalization of Principal Components Analysis to the Exponential Family
Collins, M., Dasgupta, S., & Schapire, R. E. (2001) · Cited by 382
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
Motion segmentation with missing data using powerfactorization and GPCA
Vidal, R., & Hartley, R. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315180 · Cited by 176
Self-citationA Generalization of Principal Component Analysis to the Exponential Family
Collins, M., Dasgupta, S., & Schapire, R. E. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0084 · Cited by 162
Two-View Multibody Structure from Motion
Vidal, R., Ma, Y., Soatto, S., et al. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-4839-7 · Cited by 149
Self-citationGeneralized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2003.1211411 · Cited by 139
Self-citationShizawa, M., & Maze, K. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1991.139704 · Cited by 74
Segmentation of dynamic scenes from image intensities
Vidal, R., & Sastry, S. (2003) · IEEE Workshop on Motion and Video Computing · doi:10.1109/motion.2002.1182212 · Cited by 13
Self-citation
Cited by
Sparse 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
Self-citationDictionaries for Sparse Representation Modeling
Rubinstein, R., Bruckstein, A. M., & Elad, M. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2040551 · Cited by 1,306
Elhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Self-citationGeneralized 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
On the Role of Sparse and Redundant Representations in Image Processing
Elad, M., Figueiredo, M. A. T., & Ma, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2037655 · Cited by 663
Self-citation
Metadata
- Authors
- Vidal, R., Ma, Y., & Sastry, S.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-12
- Volume
- 27
- Issue
- 12
- Pages
- 1945-1959
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2177347332
- Cited by
- 1,038
- References
- 23
- FWCI
- 26.11
- 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.