The Comparison of Laplacianfaces QR Decomposition and Linear Discriminant Analysis QR Decomposition Algorithm for Face Recognition System on Orthogonal Subspace

2014 ◽  
Vol 71 (1) ◽  
Author(s):  
Purbandini Purbandini

Development of an optimal face recognition system will greatly depend on the characteristics of the selection process are as a basis to pattern recognition. In the characteristic selection process, there are 2 aspects that will be of mutual influence such the reduction of the amount of data used in the classification aspects and increasing discrimination ability aspects. Linear Discriminat Analysis method helps presenting the global structure while Laplacianfaces method is one method that is based on appearance (appearance-based method) in face recognition, in which the local manifold structure presented in the adjacency graph mapped from the training data points. Linear Discriminant Analysis QR decomposition has a computationally low cost because it has small dimensions so that the efficiency and scalability are very high when compared with algorithms of other Linear Discriminant Analysis methods. Laplacianfaces QR decomposition was a algorithm to obtain highly speed and accuracy, and tiny space to keep data on the face recognition. This algorithm consists of 2 stages. The first stage maximizes the distance of between-class scatter matrices by using QR decomposition and the second stage to minimize the distance of within-class scatter matrices. Therefore, it is obtained an optimal discriminant in the data. In this research, classification using the Euclidean distance method. In these experiments using face databases of the Olivetti-Att-ORL, Bern and Yale. The minimum error was achieved with the Laplacianfaces QR decomposition and Linear Discriminant Analysis QR decomposition are 5.88% and 9.08% respectively. 

Author(s):  
Abdul Quyoom

Face recognition is a hard and special case of computer vision and pattern recognition. It is a challenging problem due to various kinds of variations of face images.  This paper proposes a robust face recognition system. Here stepwise linear discriminant analysis (SWLDA) is used for the feature extraction and Linear Vector Quantization (LVQ) Classifier is used for face recognition. The main focus of SWLDA is to select localized features from the face. In order to increase the low-between-class variance and to reduce within-class-variance among different expression classes and use F-test value through which results are analyzed. In recognition, firstly face is detected using canny edge detection method, after face detection SWLDA is employed to extract the face features, and end linear vector quantization is applied for face recognition. To achieve optimum results and increase the robustness of the proposed system, experiments are performed on various different samples of face image, which consist of face image with the different pose and facial expression in order to validate the system, we use two famous datasets which include Yale and ORL face database.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Wen-Sheng Chen ◽  
Chu Zhang ◽  
Shengyong Chen

Fisher linear discriminant analysis (FLDA) is a classic linear feature extraction and dimensionality reduction approach for face recognition. It is known that geometric distribution weight information of image data plays an important role in machine learning approaches. However, FLDA does not employ the geometric distribution weight information of facial images in the training stage. Hence, its recognition accuracy will be affected. In order to enhance the classification power of FLDA method, this paper utilizes radial basis function (RBF) with fractional order to model the geometric distribution weight information of the training samples and proposes a novel geometric distribution weight information based Fisher discriminant criterion. Subsequently, a geometric distribution weight information based LDA (GLDA) algorithm is developed and successfully applied to face recognition. Two publicly available face databases, namely, ORL and FERET databases, are selected for evaluation. Compared with some LDA-based algorithms, experimental results exhibit that our GLDA approach gives superior performance.


2017 ◽  
Vol 9 (1) ◽  
pp. 1-9
Author(s):  
Fandiansyah Fandiansyah ◽  
Jayanti Yusmah Sari ◽  
Ika Putri Ningrum

Face recognition is one of the biometric system that mostly used for individual recognition in the absent machine or access control. This is because the face is the most visible part of human anatomy and serves as the first distinguishing factor of a human being. Feature extraction and classification are the key to face recognition, as they are to any pattern classification task. In this paper, we describe a face recognition method based on Linear Discriminant Analysis (LDA) and k-Nearest Neighbor classifier. LDA used for feature extraction, which directly extracts the proper features from image matrices with the objective of maximizing between-class variations and minimizing within-class variations. The features of a testing image will be compared to the features of database image using K-Nearest Neighbor classifier. The experiments in this paper are performed by using using 66 face images of 22 different people. The experimental result shows that the recognition accuracy is up to 98.33%. Index Terms—face recognition, k nearest neighbor, linear discriminant analysis.


Sign in / Sign up

Export Citation Format

Share Document