Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminant Waveletfaces and Nearest Feature Classifiers for Face Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lambertian Reflectance and Linear Subspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Acquiring Linear Subspaces for Face Recognition under Variable Lighting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A feature extraction method for use with bimodal biometrics
Pattern Recognition
Linear Regression for Face Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition using the nearest feature line method
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
In this paper, we proposed a new linear regression-based approach for face recognition, called farthest subspace classification. In previous literatures, it was believed that the facial images from a specific object class tend to lie on a linear subspace, i.e. the class-specific subspace. Therefore a query image will be considered belonging to its nearest subspace (NS) of a class. The distance from a query image to each class-specific subspace is calculated simply by the linear regression. In this paper, we proposed a novel notion of face recognition that in the complete feature space spanned by all the gallery images, each class-specific subspace has not only common subspace shared by every class-specific subspace, but also its unique coordinate bases, which are available discriminative information. Based on this notion, we develop farthest subspace (FS) classifier to perform face recognition. The experimental results supported the proposed novel concept. Furthermore, we proposed nearest-farthest subspace (NFS) classification using both NS and FS rules, which outperform NS used alone.