scholarly journals An MPCA/LDA Based Dimensionality Reduction Algorithm for Face Recognition

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jun Huang ◽  
Kehua Su ◽  
Jamal El-Den ◽  
Tao Hu ◽  
Junlong Li
Keyword(s):  
Face Recognition ◽  
Nearest Neighbor ◽  
Recognition Accuracy ◽  
Principal Component ◽  
Feature Space ◽  
Recognition Algorithm ◽  
Linear Discriminant ◽  
Face Images ◽  
Sample Set ◽  
Multilinear Principal Component Analysis

We proposed a face recognition algorithm based on both the multilinear principal component analysis (MPCA) and linear discriminant analysis (LDA). Compared with current traditional existing face recognition methods, our approach treats face images as multidimensional tensor in order to find the optimal tensor subspace for accomplishing dimension reduction. The LDA is used to project samples to a new discriminant feature space, while theKnearest neighbor (KNN) is adopted for sample set classification. The results of our study and the developed algorithm are validated with face databases ORL, FERET, and YALE and compared with PCA, MPCA, and PCA + LDA methods, which demonstrates an improvement in face recognition accuracy.

Anatomization of the systems of dimension relaxation for facial recognition

2020 ◽  
pp. 1-11
Author(s):  
Mayamin Hamid Raha ◽  
Tonmoay Deb ◽  
Mahieyin Rahmun ◽  
Tim Chen
Keyword(s):  
Face Recognition ◽  
Main Idea ◽  
Principal Component ◽  
Feature Space ◽  
Projection Methods ◽  
Data Representation ◽  
Linear Discriminant ◽  
Class Differences ◽  
Underlying Space ◽  
Maximum Variance

Face recognition is the most efficient image analysis application, and the reduction of dimensionality is an essential requirement. The curse of dimensionality occurs with the increase in dimensionality, the sample density decreases exponentially. Dimensionality Reduction is the process of taking into account the dimensionality of the feature space by obtaining a set of principal features. The purpose of this manuscript is to demonstrate a comparative study of Principal Component Analysis and Linear Discriminant Analysis methods which are two of the highly popular appearance-based face recognition projection methods. PCA creates a flat dimensional data representation that describes as much data variance as possible, while LDA finds the vectors that best discriminate between classes in the underlying space. The main idea of PCA is to transform high dimensional input space into the function space that displays the maximum variance. Traditional LDA feature selection is obtained by maximizing class differences and minimizing class distance.

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.

scholarly journals AN ADOPTION OF 2D-PCA/ICA BASED POST-PROCESSING DIMENSIONALITY REDUCTION ALGORITHM FOR FACIAL RECOGNITION SYSTEM

2020 ◽  
Vol 3 (2) ◽  
pp. 222-235
Author(s):  
Vivian Nwaocha ◽  
◽  
Ayodele Oloyede ◽  
Deborah Ogunlana ◽  
Michael Adegoke ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Dimensionality Reduction ◽  
Nearest Neighbor ◽  
Gaussian Function ◽  
Principal Component ◽  
Component Analysis ◽  
Two Dimensional ◽  
Discrimination Ability ◽  
Face Images

Face images undergo considerable amount of variations in pose, facial expression and illumination condition. This large variation in facial appearances of the same individual makes most Existing Face Recognition Systems (E-FRS) lack strong discrimination ability and timely inefficient for face representation due to holistic feature extraction technique used. In this paper, a novel face recognition framework, which is an extension of the standard (PCA) and (ICA) denoted as two-dimensional Principal Component Analysis (2D-PCA) and two-dimensional Independent Component Analysis (2D-ICA) respectively is proposed. The choice of 2D was advantageous as image covariance matrix can be constructed directly using original image matrices. The face images used in this study were acquired from the publicly available ORL and AR Face database. The features belonging to similar class were grouped and correlation calculated in the same order. Each technique was decomposed into different components by employing multi-dimensional grouped empirical mode decomposition using Gaussian function. The nearest neighbor (NN) classifier is used for classification. The results of evaluation showed that the 2D-PCA method using ORL database produced RA of 92.5%, PCA produced RA of 75.00%, ICA produced RA of 77.5%, 2D-ICA produced RA of 96.00%. However, 2D-PCA methods using AR database produced RA of 73.56%, PCA produced RA of 62.41%, ICA produced RA of 66.20%, 2D-ICA method produced RA of 77.45%. This study revealed that the developed face recognition framework algorithm achieves an improvement of 18.5% and 11.25% for the ORL and AR databases respectively as against PCA and ICA feature extraction techniques. Keywords: computer vision, dimensionality reduction techniques, face recognition, pattern recognition

Face Recognition Algorithm Based on 3D Point Cloud Acquired by Mixed Image Sensor

2019 ◽  
Vol 23 (2) ◽  
pp. 366-369
Author(s):  
Tang-Tang Yi ◽  
Keyword(s):  
Face Recognition ◽  
Point Cloud ◽  
Recognition Accuracy ◽  
Image Sensor ◽  
Recognition Algorithm ◽  
Face Image ◽  
3D Point Cloud ◽  
3D Face ◽  
Face Images ◽  
The Face

In order to solve the problem of low recognition accuracy in recognition of 3D face images collected by traditional sensors, a face recognition algorithm for 3D point cloud collected by mixed image sensors is proposed. The algorithm first uses the 3D wheelbase to expand the face image edge. According to the 3D wheelbase, the noise of extended image is detected, and median filtering is used to eliminate the detected noise. Secondly, the priority of the boundary pixels to recognize the face image in the denoising image recognition process is determined, and the key parts such as the illuminance line are analyzed, so that the recognition of the 3D point cloud face image is completed. Experiments show that the proposed algorithm improves the recognition accuracy of 3D face images, which recognition time is lower than that of the traditional algorithm by about 4 times, and the recognition efficiency is high.

A Novel Face Recognition Algorithm

2013 ◽  
Vol 718-720 ◽  
pp. 2055-2061
Author(s):  
Cai Rang Zhaxi ◽  
Yue Guang Li
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Feature Space ◽  
Recognition Algorithm ◽  
Analysis Method ◽  
Fisher Linear Discriminant ◽  
Linear Discriminant ◽  
Discriminant Analysis Method ◽  
Pca Method ◽  
Better Than

This paper firstly analyzes the principle of face recognition algorithm, studies feature selection and distance criterion problem, puts forward the defects of PCA face recognition algorithm and LDA face recognition algorithm. According to the deficiencies and shortcomings of PCA face recognition algorithm and LDA face recognition algorithm, this paper proposes a solution -- PCA+LDA. The method uses the PCA method to reduce the dimensionality of feature space, it uses Fisher linear discriminant analysis method to classification, the realization of face recognition. Experiments show that, this method can not only improve the feature extraction speed, but also the recognition rate is better than single PCA method and LDA method.

SUBSPACE-BASED FACE RECOGNITION: OUTLIER DETECTION AND A NEW DISTANCE CRITERION

2005 ◽  
Vol 19 (04) ◽  
pp. 479-493 ◽  
Author(s):  
PEI CHEN ◽  
DAVID SUTER
Keyword(s):  
Face Recognition ◽  
Outlier Detection ◽  
Principal Component ◽  
Dimensional Subspace ◽  
Recognition Algorithm ◽  
New Techniques ◽  
Face Images ◽  
The Face ◽  
Low Dimensional ◽  
New Strategies

Illumination effects, including shadows and varying lighting, make the problem of face recognition challenging. Experimental and theoretical results show that the face images under different illumination conditions approximately lie in a low-dimensional subspace, hence principal component analysis (PCA) or low-dimensional subspace techniques have been used. Following this spirit, we propose new techniques for the face recognition problem, including an outlier detection strategy (mainly for those points not following the Lambertian reflectance model), and a new error criterion for the recognition algorithm. Experiments using the Yale-B face database show the effectiveness of the new strategies.

scholarly journals An Improved Face Recognition Using Neighborhood Defined Modular Phase Congruency Based Kernel PCA

2012 ◽  
pp. 288-296
Author(s):  
M.Lokeswara Reddy ◽  
P.Ramana Reddy
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Visual Image ◽  
Recognition System ◽  
Recognition Algorithm ◽  
Kernel Pca ◽  
Phase Congruency ◽  
Face Images ◽  
Facial Recognition System

A face recognition algorithm based on NMPKPCA algorithm presented in this paper. The proposed algorithm when compared with conventional Principal component analysis (PCA) algorithms has an improved recognition Rate for face images with large variations in illumination, facial expressions. In this technique, first phase congruency features are extracted from the face image so that effects due to illumination variations are avoided by considering phase component of image. Then, face images are divided into small sub images and the kernel PCA approach is applied to each of these sub images. but, dividing into small or large modules creates some problems in recognition. So a special modulation called neighborhood defined modularization approach presented in this paper, so that effects due to facial variations are avoided. Then, kernel PCA has been applied to each module to extract features. So a feature extraction technique for improving recognition accuracy of a visual image based facial recognition system presented in this paper.

scholarly journals A Novel Face Recognition Algorithm Using Gabor - based KPCA

2018 ◽  
Vol 7 (2) ◽  
pp. 124
Author(s):  
Umasankar Ch ◽  
D. Naresh Kumar ◽  
Md. Abdul Rawoof ◽  
D. Khalandar Basha ◽  
N. Madhu
Keyword(s):  
Face Recognition ◽  
Structural Characteristics ◽  
Feature Space ◽  
Facial Feature ◽  
Input Image ◽  
Recognition Algorithm ◽  
Nonlinear Mapping ◽  
Kernel Pca ◽  
Face Images ◽  
The Face

The Gabor wavelets are used to extract facial features, and then a doubly nonlinear mapping kernel PCA (DKPCA) is proposed to perform feature transformation and face recognition. The conventional kernel PCA nonlinearly maps an input image into a high-dimensional feature space in order to make the mapped features linearly separable. However, this method does not consider the structural characteristics of the face images, and it is difficult to determine which nonlinear mapping is more effective for face recognition. In this work, a new method of nonlinear mapping, which is performed in the original feature space, is defined. The proposed nonlinear mapping not only considers the statistical properties of the input features, but also adopts an Eigen mask to emphasize those important facial feature points The proposed algorithm is evaluated based on the Yale database, the AR database, the ORL database and the YaleB database.

scholarly journals Recognition of Reconstructed Frontal Face Images Using FFT-PCA/SVD Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Louis Asiedu ◽  
Felix O. Mettle ◽  
Joseph A. Mensah
Keyword(s):  
Face Recognition ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Environmental Constraints ◽  
Biometric Data ◽  
Face Images ◽  
The Face ◽  
Left And Right ◽  
Value Decomposition ◽  
User Friendly

Face recognition has gained prominence among the various biometric-based methods (such as fingerprint and iris) due to its noninvasive characteristics. Modern face recognition modules/algorithms have been successful in many application areas (access control, entertainment/leisure, security system based on biometric data, and user-friendly human-machine interfaces). In spite of these achievements, the performance of current face recognition algorithms/modules is still inhibited by varying environmental constraints such as occlusions, expressions, varying poses, illumination, and ageing. This study assessed the performance of Principal Component Analysis with singular value decomposition using Fast Fourier Transform (FFT-PCA/SVD) for preprocessing the face recognition algorithm on left and right reconstructed face images. The study found that average recognition rates for the FFT-PCA/SVD algorithm were 95% and 90% when the left and right reconstructed face images are used as test images, respectively. The result of the paired sample t-test revealed that the average recognition distances for the left and right reconstructed face images are not significantly different when FFT-PCA/SVD is used for recognition. FFT-PCA/SVD is recommended as a viable algorithm for recognition of left and right reconstructed face images.

A HYBRID TWO-PHASE ALGORITHM FOR FACE RECOGNITION

2004 ◽  
Vol 18 (08) ◽  
pp. 1423-1435 ◽  
Author(s):  
FRANK Y. SHIH ◽  
KAI ZHANG ◽  
YAN-YU FU
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Support Vector ◽  
Second Phase ◽  
Two Phase ◽  
Data Set ◽  
Linear Discriminant ◽  
Database Size

Scientists have developed numerous classifiers in the pattern recognition field, because applying a single classifier is not very conducive to achieve a high recognition rate on face databases. Problems occur when the images of the same person are classified as one class, while they are in fact different in poses, expressions, or lighting conditions. In this paper, we present a hybrid, two-phase face recognition algorithm to achieve high recognition rates on the FERET data set. The first phase is to compress the large class number database size, whereas the second phase is to perform the decision-making. We investigate a variety of combinations of the feature extraction and pattern classification methods. Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and Support Vector Machine (SVM) are examined and tested using 700 facial images of different poses from FERET database. Experimental results show that the two combinations, LDA+LDA and LDA+SVM, outperform the other types of combinations. Meanwhile, when classifiers are considered in the two-phase face recognition, it is better to adopt the L1 distance in the first phase and the class mean in the second phase.

Sign in / Sign up

Export Citation Format

Share Document