Grassmann discriminant analysis: a unifying view on subspace-based learning
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
In this paper we propose a discriminant learning framework for problems in which data consist of linear subspaces instead of vectors. By treating subspaces as basic elements, we can make learning algorithms adapt naturally to the problems with linear invariant structures. We propose a unifying view on the subspace-based learning method by formulating the problems on the Grassmann manifold, which is the set of fixed-dimensional linear subspaces of a Euclidean space. Previous methods on the problem typically adopt an inconsistent strategy: feature extraction is performed in the Euclidean space while non-Euclidean distances are used. In our approach, we treat each sub-space as a point in the Grassmann space, and perform feature extraction and classification in the same space. We show feasibility of the approach by using the Grassmann kernel functions such as the Projection kernel and the Binet-Cauchy kernel. Experiments with real image databases show that the proposed method performs well compared with state-of-the-art algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
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
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Analyzing appearance and contour based methods for object categorization
Leibe, B., & Schiele, B. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211497 · Cited by 787
Metric spaces and positive definite functions
Schoenberg, I. J. (1938) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1938-1501980-0 · Cited by 702
Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations
Kim, T.-K., Kittler, J., & Cipolla, R. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1037 · Cited by 590
Face recognition using temporal image sequence
Yamaguchi, O., Fukui, E., & Maeda, K. (2002) · Proceedings Third IEEE International Conference on Automatic Face and Gesture Recognition · doi:10.1109/afgr.1998.670968 · Cited by 462
Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic Computation
Absil, P.-A., Mahony, R., & Sepulchre, R. (2004) · Acta Applicandae Mathematica · doi:10.1023/b:acap.0000013855.14971.91 · Cited by 393
A generalized kernel approach to dissimilarity-based classification
Pękalska, E., Paclı́k, P., & Duin, R. P. W. (2002) · doi:10.5555/944790.944810 · Cited by 350
Face Recognition from Long-Term Observations
Shakhnarovich, G., Fisher, J. W., & Darrell, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47977-5_56 · Cited by 299
Learning with non-positive kernels
Ong, C. S., Mary, X., Canu, S., & Smola, A. J. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015443 · Cited by 237
A kernel between sets of vectors
Kondor, R., & Jebara, T. (2003) · Cited by 235
Feature space interpretation of SVMs with indefinite kernels
Haasdonk, B. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.78 · Cited by 233
Zhou, S. K., & Chellappa, R. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.120 · Cited by 172
Kernel mutual subspace method for robust facial image recognition
Sakano, H., & Mukawa, N. (2002) · International Conference on Knowledge-Based Intelligent Electronic Systems (KES) · doi:10.1109/kes.2000.885803 · Cited by 40
Illumination Face Spaces Are Idiosyncratic.Preprint
Chang, J.-M., Beveridge, J. R., Draper, B. A., et al. (2006) · Cited by 17
Cited by
LoRA: Low-Rank Adaptation of Large Language Models
Hu, E. J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., & Chen, W. (2021) · arXiv · doi:10.48550/arxiv.2106.09685 · Cited by 13,453
Geodesic flow kernel for unsupervised domain adaptation
Gong, B., Shi, Y., Sha, F., & Grauman, K. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247911 · Cited by 2,093
Domain adaptation for object recognition: An unsupervised approach
Gopalan, R., Li, R., & Chellappa, R. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126344 · Cited by 1,053
Visual Domain Adaptation with Manifold Embedded Distribution Alignment
Wang, J., Feng, W., Chen, Y., Yu, H., Huang, M., & Yu, P. S. (2018) · Proceedings of the 26th ACM international conference on Multimedia · doi:10.1145/3240508.3240512 · Cited by 638
Covariance discriminative learning: A natural and efficient approach to image set classification
Wang, R., Guo, H., Davis, L. S., & Dai, Q. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247965 · Cited by 433
Metadata
- Authors
- Hamm, J., & Lee, D. D.
- Venue
- Proceedings of the 25th international conference on Machine learning - ICML '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 376-383
- OpenAlex
- W2126017757
- Cited by
- 592
- References
- 20
- FWCI
- 7.75
- 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.