A flexible and effective linearization method for subspace learning
- Publication Type:
- Graph Embedding for Pattern Analysis, 2013, pp. 177 - 203
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© Springer Science+Business Media New York 2013. In the past decades, a large number of subspace learning or dimension reduction methods [2,16,20,32,34,37,44] have been proposed. Principal component analysis (PCA)  pursues the directions of maximum variance for optimal reconstruction. Linear discriminant analysis (LDA) , as a supervised algorithm, aims to maximize the inter-class scatter and at the same timeminimize the intra-class scatter. Due to utilization of label information, LDA is experimentally reported to outperform PCA for face recognition, when sufficient labeled face images are provided .
Please use this identifier to cite or link to this item: