Manifold Regularized Principal Component Analysis Method Using L2,p-Norm

Abstract

The main idea of principal component analysis (PCA) is to transform the problem of high-dimensional space into low-dimensional space, and obtain the output sample set after a series of operations on the samples. However, the accuracy of the traditional principal component analysis method in dimension reduction is not very high, and it is very sensitive to outliers. In order to improve the robustness of image recognition to noise and the importance of geometric information in a given data space, this paper proposes a new unsupervised feature extraction model based on l2,p-norm PCA and manifold learning method. To improve robustness, the model method adopts l2,p-norm to reconstruct the distance measure between the error and the original input data. When the image is occluded, the projection direction will not significantly deviate from the expected solution of the model, which can minimize the reconstruction error of the data and improve the recognition accuracy. To verify whether the algorithm proposed by the method is robust, the data sets used in this experiment include ORL database, Yale database, FERET database, and PolyU palmprint database. In the experiments of these four databases, the recognition rate of the proposed method is higher than that of other methods when p=0.5. Finally, the experimental results show that the method proposed in this paper is robust and effective.

Keywords

• principal component analysis
• manifold learning
• features extracting
• <i>l</i>_2,<i>p</i>-norm
• neighborhood preserving embedding