Affiliations: Engineering Science Laboratory, National School of Applied Sciences (ENSA), Ibn Tofail University, Kenitra, Morocco
Correspondence:
[*]
Corresponding author: Ayyad Maafiri, Engineering Science Laboratory, National School of Applied Sciences (ENSA), Ibn Tofail University, Kenitra, Morocco. E-mail: [email protected].
Abstract: In the last ten years, many variants of the principal component analysis were suggested to fight against the curse of dimensionality. Recently, A. Sharma et al. have proposed a stable numerical algorithm based on Householder QR decomposition (HQR) called QR PCA. This approach improves the performance of the PCA algorithm via a singular value decomposition (SVD) in terms of computation complexity. In this paper, we propose a new algorithm called RRQR PCA in order to enhance the QR PCA performance by exploiting the Rank-Revealing QR Factorization (RRQR). We have also improved the recognition rate of RRQR PCA by developing a nonlinear extension of RRQR PCA. In addition, a new robust RBF Lp-norm kernel is proposed in order to reduce the effect of outliers and noises. Extensive experiments on two well-known standard face databases which are ORL and FERET prove that the proposed algorithm is more robust than conventional PCA, 2DPCA, PCA-L1, WTPCA-L1, LDA, and 2DLDA in terms of face recognition accuracy.
Keywords: Principal component analysis, singular value decomposition, householder QR decomposition, rank-revealing QR factorization, face recognition
