Deterministic learning machine for face recognition with multi-model feature extraction

2016 ◽  
Author(s):  
Virendra P. Vishwakarma
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Deterministic Learning ◽  
Learning Machine

scholarly journals Feature Extraction Based Face Recognition Using Extreme Learning Machine (ELM)

2016 ◽  
pp. 80-83
Author(s):  
NAGABHAIRAVA VENKATA SIDDARTHA ◽  
MOHAMMAD UMAR ◽  
NABANKUR SEN ◽  
P. KRISHNA PRASAD
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Extreme Learning Machine ◽  
Credit Card ◽  
Recognition System ◽  
Extraction Process ◽  
Biometric Identification ◽  
Face Recognition System ◽  
The Face ◽  
Learning Machine

In recent years, Face recognition becomes one of the popular biometric identification systems used in identifying or verifying individuals and matching it against library of known faces. Biometric identification is an actively growing area of research and used in electronic commerce, electronic banking, electronic passports, electronic licences and security applications. Face recognition finds its application in wide variety of areas like criminal identification, human - computer interaction, security systems, credit- card verification, teleconference, image and film processing. This paper suggests an automated face recognition system which extracts the features from the face. Feature extraction process includes locating the position of eyes, nostrils and mouth and determining the distances between those regions. From the extracted features, a database is created for known individuals. A virtual neural network is created based on Extreme Learning Machine (ELM).

Kernel Null Space Marginal Fisher Analysis for Face Recognition

2014 ◽  
Vol 889-890 ◽  
pp. 1065-1068
Author(s):  
Yu’e Lin ◽  
Xing Zhu Liang ◽  
Hua Ping Zhou
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Sample Size ◽  
High Performance ◽  
Null Space ◽  
Small Sample Size ◽  
Recognition Rate ◽  
Original Data ◽  
Small Sample ◽  
Neighborhood Structure

In the recent years, the feature extraction algorithms based on manifold learning, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure, have drawn much attention. Among them, the Marginal Fisher Analysis (MFA) achieved high performance for face recognition. However, MFA suffers from the small sample size problems and is still a linear technique. This paper develops a new nonlinear feature extraction algorithm, called Kernel Null Space Marginal Fisher Analysis (KNSMFA). KNSMFA based on a new optimization criterion is presented, which means that all the discriminant vectors can be calculated in the null space of the within-class scatter. KNSMFA not only exploits the nonlinear features but also overcomes the small sample size problems. Experimental results on ORL database indicate that the proposed method achieves higher recognition rate than the MFA method and some existing kernel feature extraction algorithms.

Face recognition based on extreme learning machine

2011 ◽  
Vol 74 (16) ◽  
pp. 2541-2551 ◽  
Author(s):  
Weiwei Zong ◽  
Guang-Bin Huang
Keyword(s):  
Face Recognition ◽  
Extreme Learning Machine ◽  
Learning Machine

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.

An Enhanced Fractal Dimension Based Feature Extraction for Thermal Face Recognition

2018 ◽  
pp. 217-226 ◽  
Author(s):  
Sandip Joardar ◽  
Arnab Sanyal ◽  
Dwaipayan Sen ◽  
Diparnab Sen ◽  
Amitava Chatterjee
Keyword(s):  
Feature Extraction ◽  
Fractal Dimension ◽  
Face Recognition ◽  
Thermal Face
Sign in / Sign up

Export Citation Format

Share Document