Subspace Methods for Face Recognition: Singularity, Regularization, and Robustness

Wangmeng Zuo, Kuanquan Wang, Hongzhi ZhangOpenalex Unknown 2009 · DOI · OpenAlex

Abstract

Face recognition remains a significant challenge in computer vision due to high-dimensional data and limited training samples, often referred to as the "Small Sample Size" (SSS) problem. This paper explores subspace methods to address three critical issues: matrix singularity in Linear Discriminant Analysis (LDA), over-fitting of discriminant vectors, and sensitivity to image occlusions. We propose a multi-faceted approach involving Bi-Directional Principal Component Analysis (BDPCA) combined with LDA, a post-processing Gaussian filter for regularization, and Iteratively Reweighted Fitting (IRF) for robustness against noise and occlusions.

Introduction

Holistic-based face recognition extracts features from the entire face region, offering robustness against noise and blurring. However, the high dimensionality of facial images leads to the "curse of dimensionality." Subspace methods aim to reduce this dimensionality while preserving discriminative information. In practice, face recognition systems often face the "Small Sample Size" (SSS) problem, where the number of available training images per person is much smaller than the dimensionality of the feature space. This leads to mathematical instabilities and poor generalization.

Challenges in Subspace-Based Recognition

Traditional subspace methods like Linear Discriminant Analysis (LDA) rely on the analysis of scatter matrices to find optimal projection vectors.

The Singularity Problem

LDA seeks to maximize the ratio of between-class scatter ($S_b$) to within-class scatter ($S_w$). In SSS scenarios, $S_w$ often becomes singular (non-invertible) because the number of samples is insufficient to span the high-dimensional space. This prevents the direct calculation of the optimal discriminant vectors, causing standard mathematical solvers to fail.

Illustration of (a) class distributions and (b) the resulting between-class ($S_b$) and within-class ($S_w$) scatter matrices.

Over-fitting and Noise Sensitivity

Discriminant vectors derived from limited data can become "noisy" or "wiggly," capturing high-frequency pixel variations that do not represent actual facial features. Furthermore, standard methods like Eigenfaces are highly sensitive to partial occlusions (e.g., sunglasses, scarves) and non-Gaussian noise, as they treat all pixels with equal importance, regardless of whether they are part of the face or an obstruction.

Proposed Methodology

To overcome these limitations, we introduce three key enhancements to the subspace framework.

BDPCA+LDA for Efficient Feature Extraction

Instead of flattening an $80 \times 80$ image into a 6,400-dimensional vector, Bi-Directional PCA (BDPCA) operates directly on image matrices. By projecting the image matrix onto two lower-dimensional subspaces simultaneously, BDPCA preserves spatial structure and significantly reduces the dimensionality before LDA is applied. This approach mitigates the singularity problem and reduces computational costs.

Post-processed LDA (PEFM)

To regularize the learning process, we apply a 2D-Gaussian filter to the discriminant vectors. This "smoothing" operation incorporates a spatial prior, ensuring that neighboring pixels contribute coherently to the classification. This method, termed the Post-processed Eigenface Method (PEFM), effectively reduces over-fitting and improves recognition accuracy by focusing on broader facial structures rather than isolated pixel noise. This is theoretically linked to the Image Euclidean Distance (IMED) metric.

Selection of the optimal discriminant vector $\phi_1$ based on the eigenvectors of the scatter matrices to maximize class separation.

Robustness via IRF-Eigenfaces

For handling occlusions, we replace standard linear projection with Iteratively Reweighted Fitting (IRF). Using an Iteratively Reweighted Least Squares (IRLS) algorithm, the model identifies occluded regions as statistical outliers and assigns them lower weights. This allows for accurate recognition even when significant portions of the face are hidden by accessories like sunglasses or scarves.

Experimental Results

The proposed methods were evaluated on the FERET and AR face databases.

  • Efficiency & Accuracy: On the FERET dataset, BDPCA+LDA achieved an Average Recognition Rate (ARR) of 87.14%, outperforming standard PCA+LDA (84.69%). Training time was slashed from 254.2 seconds to just 57.5 seconds.
  • Extreme Noise Robustness: In tests with 50% "salt and pepper" noise, standard Eigenfaces' accuracy plummeted to 36.67%. IRF-Eigenfaces maintained a staggering 95.83% accuracy.
  • Handling Occlusion: On the AR database, IRF-Eigenfaces achieved over 91% accuracy for faces wearing scarves, compared to only 35% for standard Eigenfaces.

Conclusion

By addressing singularity through matrix-based dimensionality reduction, over-fitting through spatial regularization, and occlusion through robust iterative fitting, we significantly enhance the performance of subspace methods for face recognition. Future work will focus on integrating these techniques into a unified framework capable of handling simultaneous variations in pose, illumination, and expression.

Summary updated

Abstract

Face recognition has been an important issue in computer vision and pattern recognition over the last several decades While human can recognize faces easily, automated face recognition remains a great challenge in computer-based automated recognition research. One difficulty in face recognition is how to handle the variations in expression, pose and illumination when only a limited number of training samples are available. Currentlyface recognition methods can be grouped into three categories, feature-based, holistic-based, and hybrid approaches Feature-based approaches, which extract local features such as the locations and local statistics of the eyes, nose, and mouth, had been investigated in the beginning of the face recognition research Recently, with the introduction of elastic bunch graph matching (Wiskott, 1997) and local binary pattern Holistic-based approaches extract a holistic representation of the whole face region, and have robust recognition performance under noise, blurring, and partial occlusion. After the introduction of Eigenfaces Motivated by human perception system, hybrid approaches use both local feature and the whole face region for face recognition, and thus are expected to be potentially effective in improving recognition accuracy. In holistic-based face recognition, feature extraction is fundamental, which can be revealed from three aspects. First, the input facial image is high dimensional and most current recognition approaches suffer from the "curse of dimensionality" problem. Thus a feature extraction step is necessary. Second, facial image usually contains less discriminative or unfavorable information for recognition (e.g., illumination). By making use of feature extraction, this information can be efficiently suppressed while retaining discriminative information. Third, feature extraction can greatly reduce the dimensionality of facial image, and this reduces the system's memory and computational requirements. Subspace method, which aims to reduce the dimension of the data while retaining the statistical separation property between distinct classes, has been a natural choice for facial feature extraction. Face images, however, are generally high dimensional and their withinclass variations is much larger than the between-class variations, which will cause the serious performance degradation of classical subspace methods. By far, various subspace methods have been proposed and applied to face recognition.
BibTeX
@inproceedings{zuo2009subspace,
  author = {Wangmeng Zuo and Kuanquan Wang and Hongzhi Zhang},
  title = {{Subspace Methods for Face Recognition: Singularity, Regularization, and Robustness}},
  booktitle = {Openalex Unknown},
  year = {2009},
  doi = {10.5772/6638},
}
Figure