scholarly journals Analysis of Facial Image Extraction on Facial Recognition using Kohonen SOM for UNPRI SIAKAD Online User Authentication

SinkrOn ◽  
2019 ◽  
Vol 4 (1) ◽  
pp. 171 ◽  
Author(s):  
Reyhan Achmad Rizal ◽  
Christnatalis HS
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
User Authentication ◽  
Facial Recognition ◽  
Principal Component ◽  
Analytical Framework ◽  
Academic Community ◽  
Linear Discriminant ◽  
Academic Information ◽  
Kohonen Som

Academic Information System (Sistem Informasi Akademik aka SIAKAD) Online of Universitas Prima Indonesia (UNPRI) is one of the applications used to facilitate the administration process of lectures which includes the filling process of study plan cards (Kartu Rencana Studi aka KRS), study result cards (Kartu Hasil Studi aka KHS), class schedules, submission of research titles, seminars, and other processes. SIAKAD UNPRI can be accessed by students, lecturers, and academics where every user has a password that has been encrypted to maintain the security of information from people who are not responsible, password security using the encryption method needs to be changed regularly, but there are still many students, lecturers and academic community who are reluctant to change passwords. To improve the security verification stage for SIAKAD users, we propose a face recognition feature approach. Face recognition is a feature that allows the identification of someone from a digital image or video. The way the facial recognition method works is by comparing face data from the camera or images with images that were previously stored in a database. In this study, the Kohonen SOM method is proposed for face identification based on the feature extraction approach of discrete cosine transform (DCT), linear discriminant analysis (LDA) and principal component analysis (PCA) to improve the security of UNPRI SIAKAD users. The analytical framework is done by requiring students to do face taking, where each student will save 5 (five) faces extracted with facial features using the DCT, LDA and PCA model approach, feature extraction results are used as input to the Kohonen SOM network for training and testing facial recognition, then analysis of the effect of DCT, LDA and PCA feature extraction on the Kohonen network on facial recognition accuracy.

scholarly journals ROBUST DETECTION AND RECOGNITION SYSTEM BASED ON FACIAL EXTRACTION AND DECISION TREE

2021 ◽  
Vol 25 (4) ◽  
pp. 40-50
Author(s):  
Ansam H. Rashed ◽  
◽  
Muthana H. Hamd ◽  
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Face Detection ◽  
Principal Component ◽  
Recognition System ◽  
Image Features ◽  
Machine Learning Algorithms ◽  
Linear Discriminant ◽  
Robust Detection ◽  
Time Systems

Automatic face recognition system is suggested in this work on the basis of appearance based features focusing on the whole image as well as local based features focusing on critical face points like eyes, mouth, and nose for generating further details. Face detection is the major phase in face recognition systems, certain method for face detection (Viola-Jones) has the ability to process images efficiently and achieve high rates of detection in real time systems. Dimension reduction and feature extraction approaches are going to be utilized on the cropped image caused by detection. One of the simple, yet effective ways for extracting image features is the Local Binary Pattern Histogram (LBPH), while the technique of Principal Component Analysis (PCA) was majorly utilized in pattern recognition. Also, the technique of Linear Discriminant Analysis (LDA) utilized for overcoming PCA limitations was efficiently used in face recognition. Furthermore, classification is going to be utilized following the feature extraction. The utilized machine learning algorithms are PART and J48. The suggested system is showing high accuracy for detection with Viola-Jones 98.75, whereas the features which are extracted by means of LDA with J48 provided the best results of (F-measure, Recall, and Precision).

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 PEM-PCA: A Parallel Expectation-Maximization PCA Face Recognition Architecture

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Kanokmon Rujirakul ◽  
Chakchai So-In ◽  
Banchar Arnonkijpanich
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Expectation Maximization ◽  
High Speed ◽  
Expectation Maximization Algorithm ◽  
Parallel Architecture ◽  
Principal Component ◽  
Eigenvalue Decomposition ◽  
Computational Time ◽  
Recognition Systems

Principal component analysis or PCA has been traditionally used as one of the feature extraction techniques in face recognition systems yielding high accuracy when requiring a small number of features. However, the covariance matrix and eigenvalue decomposition stages cause high computational complexity, especially for a large database. Thus, this research presents an alternative approach utilizing an Expectation-Maximization algorithm to reduce the determinant matrix manipulation resulting in the reduction of the stages’ complexity. To improve the computational time, a novel parallel architecture was employed to utilize the benefits of parallelization of matrix computation during feature extraction and classification stages including parallel preprocessing, and their combinations, so-called a Parallel Expectation-Maximization PCA architecture. Comparing to a traditional PCA and its derivatives, the results indicate lower complexity with an insignificant difference in recognition precision leading to high speed face recognition systems, that is, the speed-up over nine and three times over PCA and Parallel PCA.

scholarly journals Pengenalan Wajah Menggunakan Metode Linear Discriminant Analysis dan k Nearest Neighbor

2017 ◽  
Vol 9 (1) ◽  
pp. 1-9
Author(s):  
Fandiansyah Fandiansyah ◽  
Jayanti Yusmah Sari ◽  
Ika Putri Ningrum
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
Nearest Neighbor ◽  
Experimental Result ◽  
K Nearest Neighbor ◽  
Linear Discriminant ◽  
Nearest Neighbor Classifier ◽  
Neighbor Classifier

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.

A Lyapunov Theory-Based Neural Network Approach for Face Recognition

2010 ◽  
pp. 23-48 ◽  
Author(s):  
Li-Minn Ang ◽  
King Hann Lim ◽  
Kah Phooi Seng ◽  
Siew Wen Chin
Keyword(s):  
Neural Network ◽  
Face Recognition ◽  
Principal Component ◽  
Lyapunov Stability Theory ◽  
Recognition System ◽  
Lyapunov Theory ◽  
Neural Network Approach ◽  
Linear Discriminant ◽  
Feature Based ◽  
Definition Of

This chapter presents a new face recognition system comprising of feature extraction and the Lyapunov theory-based neural network. It first gives the definition of face recognition which can be broadly divided into (i) feature-based approaches, and (ii) holistic approaches. A general review of both approaches will be given in the chapter. Face features extraction techniques including Principal Component Analysis (PCA) and Fisher’s Linear Discriminant (FLD) are discussed. Multilayered neural network (MLNN) and Radial Basis Function neural network (RBF NN) will be reviewed. Two Lyapunov theory-based neural classifiers: (i) Lyapunov theory-based RBF NN, and (ii) Lyapunov theory-based MLNN classifiers are designed based on the Lyapunov stability theory. The design details will be discussed in the chapter. Experiments are performed on two benchmark databases, ORL and Yale. Comparisons with some of the existing conventional techniques are given. Simulation results have shown good performance for face recognition using the Lyapunov theory-based neural network systems.

Matrix Based Feature Measurement and Extraction for Face Recognition

2015 ◽  
Vol 738-739 ◽  
pp. 643-647
Author(s):  
Qi Zhu ◽  
Jin Rong Cui ◽  
Zi Zhu Fan
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Face Recognition ◽  
Measurement Method ◽  
Principal Component ◽  
Component Analysis ◽  
High Accuracy ◽  
Face Image ◽  
Two Dimensional ◽  
The Matrix

In this paper, a matrix based feature extraction and measurement method, i.e.: multi-column principle component analysis (MCPCA) is used to directly and effectively extract features from the matrix. We analyze the advantages of MCPCA over the conventional principal component analysis (PCA) and two-dimensional PCA (2DPCA), and we have successfully applied it into face image recognition. Extensive face recognition experiments illustrate that the proposed method obtains high accuracy, and it is more robust than previous conventional face recognition methods.

A THEORETICAL FRAMEWORK FOR MATRIX-BASED FEATURE EXTRACTION ALGORITHMS WITH ITS APPLICATION TO IMAGE RECOGNITION

2008 ◽  
Vol 08 (01) ◽  
pp. 1-23 ◽  
Author(s):  
GUIYU FENG ◽  
DAVID ZHANG ◽  
JIAN YANG ◽  
DEWEN HU
Keyword(s):  
Feature Extraction ◽  
Principal Component ◽  
Theoretical Framework ◽  
Small Sample ◽  
Point Of View ◽  
Two Dimensional ◽  
Linear Discriminant ◽  
The Matrix ◽  
Small Sample Sizes ◽  
Special Case

Recently proposed matrix-based methods, two-dimensional Principal Component Analysis (2DPCA), two-dimensional Linear Discriminant Analysis (2DLDA) and two-dimensional Locality Preserving Projections (2DLPP) have been shown to be effective ways to avoid the problems of high dimensionality and small sample sizes that are associated with vector-based methods. In this paper, we propose a general theoretical framework for matrix-based feature extraction algorithms from the point of view of graph embedding. Our framework can be applied to extend two recently proposed vector-based algorithms, i.e. Unsupervised Discriminant Projection (UDP) and Marginal Fisher Analysis (MFA) algorithms, to their matrix-based versions. Further, our framework can also be used as a platform to generate new matrix-based feature extraction algorithms by designing meaningful graphs, e.g. two-dimensional Discriminant Embedding Analysis (2DDEA) in this paper. It is shown that 2DLDA is actually a special case of the 2DDEA method. Experiments on three publicly available image databases demonstrate the effectiveness of the proposed algorithm. Our results fit into the scene for a better picture about the matrix-based feature extraction algorithms.

Sign in / Sign up

Export Citation Format

Share Document