Fast second-order orthogonal tensor subspace analysis for face recognition
Summary: Tensor subspace analysis (TSA) and discriminant TSA (DTSA) are two effective two-sided projection methods for dimensionality reduction and feature extraction of face image matrices. However, they have two serious drawbacks. Firstly, TSA and DTSA iteratively compute the left and right projection matrices. At each iteration, two generalized eigenvalue problems are required to solve, which makes them inapplicable for high dimensional image data. Secondly, the metric structure of the facial image space cannot be preserved since the left and right projection matrices are not usually orthonormal. In this paper, we propose the orthogonal TSA (OTSA) and orthogonal DTSA (ODTSA). In contrast to TSA and DTSA, two trace ratio optimization problems are required to be solved at each iteration. Thus, OTSA and ODTSA have much less computational cost than their nonorthogonal counterparts since the trace ratio optimization problem can be solved by the inexpensive Newton-Lanczos method. Experimental results show that the proposed methods achieve much higher recognition accuracy and have much lower training cost.
- Face recognition using tensor local Fisher discriminant analysis
- Orthogonal tensor neighborhood preserving embedding for facial expression recognition
- Facial recognition using tensor-tensor decompositions
- A low-rank tensor-based algorithm for face recognition
- Supervised orthogonal discriminant subspace projects learning for face recognition
This page was built for publication: Fast second-order orthogonal tensor subspace analysis for face recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714797)
