Face Recognition System using Discrete Cosine Transform combined with MLP and RBF Neural Networks

2012 ◽  
Vol 4 (4) ◽  
pp. 11-35 ◽  
Author(s):  
Fatma Zohra Chelali ◽  
Amar Djeradi
Keyword(s):  
Neural Networks ◽  
Face Recognition ◽  
Discrete Cosine Transform ◽  
Recognition Rate ◽  
Recognition System ◽  
Rbf Neural Networks ◽  
Cosine Transform ◽  
Linear Discriminant ◽  
Face Recognition System ◽  
Dct Coefficients

Proposed is an efficient face recognition algorithm using the discrete cosine transform DCT Technique for reducing dimensionality and image parameterization. These DCT coefficients are examined by a MLP (Multi-Layer Perceptron) and radial basis function RBF neural networks. Their purpose is to present a face recognition system that is a combination of discrete cosine transform (DCT) algorithm with a MLP and RBF neural networks. Neural networks have been widely applied in pattern recognition for the reason that neural-networks-based classifiers can incorporate both statistical and structural information and achieve better performance than the simple minimum distance classifiers. The authors demonstrate experimentally that when DCT coefficients are fed into a back propagation neural network for classification, a high recognition rate can be achieved by using a very small proportion of transform coefficients. Comparison with other statistical methods like Principal component Analysis (PCA) and Linear Discriminant Analysis (LDA) is presented. Their face recognition system is tested on the computer vision science research projects and the ORL database.

A Robust and Efficient Face Recognition System Based on Luminance Distribution Using Maximum Likelihood

2012 ◽  
Vol 241-244 ◽  
pp. 1705-1709
Author(s):  
Ching Tang Hsieh ◽  
Chia Shing Hu
Keyword(s):  
Face Recognition ◽  
Maximum Likelihood ◽  
Recognition Rate ◽  
Computation Time ◽  
Likelihood Estimation ◽  
Recognition System ◽  
Luminance Distribution ◽  
Face Region ◽  
Face Recognition System ◽  
The Face

In this paper, a robust and efficient face recognition system based on luminance distribution by using maximum likelihood estimation is proposed. The distribution of luminance components of the face region is acquired and applied to maximum likelihood test for face matching. The experimental results showed that the proposed method has a high recognition rate and requires less computation time.

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
Keyword(s):  
Face Recognition ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
Selection Process ◽  
Recognition System ◽  
Qr Decomposition ◽  
Training Data ◽  
Distance Method ◽  
Linear Discriminant ◽  
Face Recognition System

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. 

scholarly journals Real time Implementation of Face Recognition System on Raspberry Pi

2018 ◽  
Vol 7 (2.17) ◽  
pp. 85
Author(s):  
K Raju ◽  
Dr Y.Srinivasa Rao
Keyword(s):  
Face Recognition ◽  
High Performance ◽  
Recognition Rate ◽  
Cost Effective ◽  
Recognition System ◽  
Raspberry Pi ◽  
Face Recognition System ◽  
Effective System ◽  
Face Detection And Recognition ◽  
Improved Accuracy

Face Recognition is the ability to find and detect a person by their facial attributes. Face is a multi dimensional and thus requires a considerable measure of scientific calculations. Face recognition system is very useful and important for security, law authorization applications, client confirmation and so forth. Hence there is a need for an efficient and cost effective system. There are numerous techniques that are as of now proposed with low Recognition rate and high false alarm rate. Hence the major task of the research is to develop face recognition system with improved accuracy and improved recognition time. Our objective is to implementing Raspberry Pi based face recognition system using conventional face detection and recognition techniques such as A Haar cascade classifier is trained for detection and Local Binary Pattern (LBP) as a feature extraction technique. With the use of the Raspberry Pi kit, we go for influencing the framework with less cost and simple to use, with high performance. 

scholarly journals Performance Improvement of Face Recognition System using Selective Local Feature Vectors

2013 ◽  
Vol 10 (2) ◽  
pp. 1330-1338
Author(s):  
Vasudha S ◽  
Neelamma K. Patil ◽  
Dr. Lokesh R. Boregowda
Keyword(s):  
Face Recognition ◽  
Performance Improvement ◽  
Recognition Rate ◽  
Recognition System ◽  
Image Splicing ◽  
Feature Vectors ◽  
Face Recognition System ◽  
Prime Concern ◽  
Wide Range ◽  
Recognition Systems

Face recognition is one of the important applications of image processing and it has gained significant attention in wide range of law enforcement areas in which security is of prime concern. Although the existing automated machine recognition systems have certain level of maturity but their accomplishments are limited due to real time challenges. Face recognition systems are impressively sensitive to appearance variations due to lighting, expression and aging. The major metric in modeling the performance of a face recognition system is its accuracy of recognition. This paper proposes a novel method which improves the recognition accuracy as well as avoids face datasets being tampered through image splicing techniques. Proposed method uses a non-statistical procedure which avoids training step for face samples thereby avoiding generalizability problem which is caused due to statistical learning procedure. This proposed method performs well with images with partial occlusion and images with lighting variations as the local patch of the face is divided into several different patches. The performance improvement is shown considerably high in terms of recognition rate and storage space by storing train images in compressed domain and selecting significant features from superset of feature vectors for actual recognition.

Sign in / Sign up

Export Citation Format

Share Document