Sparse Nuclear Norm Two Dimensional Principal Component Analysis

2016 ◽  
pp. 547-555 ◽  
Author(s):  
Yudong Chen ◽  
Zhihui Lai ◽  
Ye Zhang
Keyword(s):  
Principal Component Analysis ◽  
Principal Component ◽  
Component Analysis ◽  
Nuclear Norm ◽  
Two Dimensional

Nuclear norm based two-dimensional sparse principal component analysis

2018 ◽  
Vol 16 (02) ◽  
pp. 1840002 ◽  
Author(s):  
Yudong Chen ◽  
Zhihui Lai ◽  
Jiajun Wen ◽  
Can Gao
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Principal Component ◽  
Component Analysis ◽  
Extraction Methods ◽  
Reconstruction Error ◽  
Nuclear Norm ◽  
Two Dimensional ◽  
Sparse Principal Component Analysis ◽  
New Feature

Two-Dimensional Principal Component Analysis (2D-PCA) is one of the most simple and effective feature extraction methods in the field of pattern recognition. However, the traditional 2D-PCA lacks robustness and the function of sparse feature extraction. In this paper, we propose a new feature extraction approach based on the traditional 2D-PCA, which is called Nuclear Norm Based Two-Dimensional Sparse Principal Component Analysis (N-2D-SPCA). To improve the robustness of 2D-PCA, we utilize nuclear norm to measure the reconstruction error of loss function. At the same time, we obtain sparse feature extraction by adding [Formula: see text]-norm and [Formula: see text]-norm regularization terms to the model. By designing an alternatively iterative algorithm, we can solve the optimization problem and learn a projection matrix for use with feature extraction. Besides, we present a bilateral projections model (BN-2D-SPCA) to further compress the dimensions of the feature matrix. We verify the effectiveness of our method on four benchmark face databases including AR, ORL, FERET and Yale databases. Experimental results show that the proposed method is more robust than some state-of-the-art methods and the traditional 2D-PCA.

scholarly journals Patch-Based Principal Component Analysis for Face Recognition

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Tai-Xiang Jiang ◽  
Ting-Zhu Huang ◽  
Xi-Le Zhao ◽  
Tian-Hui Ma
Keyword(s):  
Principal Component Analysis ◽  
Face Recognition ◽  
Nearest Neighbor ◽  
Spatial Information ◽  
Principal Component ◽  
Component Analysis ◽  
Two Dimensional ◽  
Face Images ◽  
Pca Method ◽  
Local Spatial Information

We have proposed a patch-based principal component analysis (PCA) method to deal with face recognition. Many PCA-based methods for face recognition utilize the correlation between pixels, columns, or rows. But the local spatial information is not utilized or not fully utilized in these methods. We believe that patches are more meaningful basic units for face recognition than pixels, columns, or rows, since faces are discerned by patches containing eyes and noses. To calculate the correlation between patches, face images are divided into patches and then these patches are converted to column vectors which would be combined into a new “image matrix.” By replacing the images with the new “image matrix” in the two-dimensional PCA framework, we directly calculate the correlation of the divided patches by computing the total scatter. By optimizing the total scatter of the projected samples, we obtain the projection matrix for feature extraction. Finally, we use the nearest neighbor classifier. Extensive experiments on the ORL and FERET face database are reported to illustrate the performance of the patch-based PCA. Our method promotes the accuracy compared to one-dimensional PCA, two-dimensional PCA, and two-directional two-dimensional PCA.

Sign in / Sign up

Export Citation Format

Share Document