scholarly journals Extraction and Recognition of Nonlinear Interval-Type Features Using Symbolic KDA Algorithm with Application to Face Recognition

2008 ◽  
Vol 2008 ◽  
pp. 1-5 ◽  
Author(s):  
P. S. Hiremath ◽  
C. J. Prabhakar
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Face Database ◽  
Training Set ◽  
Symbolic Data Analysis ◽  
Kernel Discriminant Analysis ◽  
Comparative Performance ◽  
Symbolic Data ◽  
Face Images ◽  
Interval Type

We present symbolic kernel discriminant analysis (symbolic KDA) for face recognition in the framework of symbolic data analysis. Classical KDA extracts features, which are single-valued in nature to represent face images. These single-valued variables may not be able to capture variation of each feature in all the images of same subject; this leads to loss of information. The symbolic KDA algorithm extracts most discriminating nonlinear interval-type features which optimally discriminate among the classes represented in the training set. The proposed method has been successfully tested for face recognition using two databases, ORL database and Yale face database. The effectiveness of the proposed method is shown in terms of comparative performance against popular face recognition methods such as kernel Eigenface method and kernel Fisherface method. Experimental results show that symbolic KDA yields improved recognition rate.

scholarly journals NIR Reflection Augmentation for DeepLearning-Based NIR Face Recognition

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1234 ◽  
Author(s):  
Jo ◽  
Kim
Keyword(s):  
Deep Learning ◽  
Face Recognition ◽  
Near Infrared ◽  
Data Augmentation ◽  
Recognition Rate ◽  
Learning Approaches ◽  
Training Set ◽  
Simple Method ◽  
Practical Applications ◽  
Face Images

Face recognition using a near-infrared (NIR) sensor is widely applied to practical applications such as mobile unlocking or access control. However, unlike RGB sensors, few deep learning approaches have studied NIR face recognition. We conducted comparative experiments for the application of deep learning to NIR face recognition. To accomplish this, we gathered five public databases and trained two deep learning architectures. In our experiments, we found that simple architecture could have a competitive performance on the NIR face databases that are mostly composed of frontal face images. Furthermore, we propose a data augmentation method to train the architectures to improve recognition of users who wear glasses. With this augmented training set, the recognition rate for users who wear glasses increased by up to 16%. This result implies that the recognition of those who wear glasses can be overcome using this simple method without constructing an additional training set. Furthermore, the model that uses augmented data has symmetry with those trained with real glasses-wearing data regarding the recognition of people who wear glasses.

scholarly journals A Novel Approach of Low-Light Image Denoising for Face Recognition

2014 ◽  
Vol 6 ◽  
pp. 256790
Author(s):  
Yimei Kang ◽  
Wang Pan
Keyword(s):  
Face Recognition ◽  
Image Denoising ◽  
Recognition Rate ◽  
Low Frequency ◽  
Frequency Noise ◽  
Low Frequency Noise ◽  
Face Database ◽  
Low Light ◽  
Very Low Frequency ◽  
Light Image

Illumination variation makes automatic face recognition a challenging task, especially in low light environments. A very simple and efficient novel low-light image denoising of low frequency noise (DeLFN) is proposed. The noise frequency distribution of low-light images is presented based on massive experimental results. The low and very low frequency noise are dominant in low light conditions. DeLFN is a three-level image denoising method. The first level denoises mixed noises by histogram equalization (HE) to improve overall contrast. The second level denoises low frequency noise by logarithmic transformation (LOG) to enhance the image detail. The third level denoises residual very low frequency noise by high-pass filtering to recover more features of the true images. The PCA (Principal Component Analysis) recognition method is applied to test recognition rate of the preprocessed face images with DeLFN. DeLFN are compared with several representative illumination preprocessing methods on the Yale Face Database B, the Extended Yale face database B, and the CMU PIE face database, respectively. DeLFN not only outperformed other algorithms in improving visual quality and face recognition rate, but also is simpler and computationally efficient for real time applications.

scholarly journals Optimization of deep learning features for age-invariant face recognition

2020 ◽  
Vol 10 (2) ◽  
pp. 1833
Author(s):  
Amal A. Moustafa ◽  
Ahmed Elnakib ◽  
Nihal F. F. Areed
Keyword(s):  
Deep Learning ◽  
Face Recognition ◽  
Nearest Neighbor ◽  
Recognition Rate ◽  
Manhattan Distance ◽  
Distance Metrics ◽  
K Nearest Neighbor ◽  
Face Images ◽  
Knn Classifier ◽  
Deep Learning Features

This paper presents a methodology for Age-Invariant Face Recognition (AIFR), based on the optimization of deep learning features. The proposed method extracts deep learning features using transfer deep learning, extracted from the unprocessed face images. To optimize the extracted features, a Genetic Algorithm (GA) procedure is designed in order to select the most relevant features to the problem of identifying a person based on his/her facial images over different ages. For classification, K-Nearest Neighbor (KNN) classifiers with different distance metrics are investigated, i.e., Correlation, Euclidian, Cosine, and Manhattan distance metrics. Experimental results using a Manhattan distance KNN classifier achieves the best Rank-1 recognition rate of 86.2% and 96% on the standard FGNET and MORPH datasets, respectively. Compared to the state-of-the-art methods, our proposed method needs no preprocessing stages. In addition, the experiments show its privilege over other related methods.

Bayesian Robust Coding Face Recognition Algorithm Based on New Dictionary

2014 ◽  
Vol 644-650 ◽  
pp. 4080-4083
Author(s):  
Ye Cai Guo ◽  
Ling Hua Zhang
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Binary Image ◽  
Test Image ◽  
Face Database ◽  
Robust Coding ◽  
The Face ◽  
Isolated Points ◽  
Rate Comparison

In order to overcome the defects that the face recognition rate can be greatly reduced in the existing uncontrolled environments, Bayesian robust coding for face recognition based on new dictionary was proposed. In this proposed algorithm, firstly a binary image is gained by gray threshold transformation and a more clear image without some isolated points can be obtained via smoothing, secondly a new dictionary can be reconstructed via fusing the binary image with the original training dictionary, finally the test image can be classified as the existing class via Bayesian robust coding. The experimental results based on AR face database show that the proposed algorithm has higher face recognition rate comparison with RRC and RSC algorithm.

scholarly journals Kernel Coupled Cross-Regression for Low-Resolution Face Recognition

2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Zhifei Wang ◽  
Zhenjiang Miao ◽  
Yanli Wan ◽  
Zhen Tang
Keyword(s):  
Face Recognition ◽  
Time Complexity ◽  
Recognition Performance ◽  
Recognition Rate ◽  
Feature Space ◽  
Low Resolution ◽  
Face Images ◽  
Novel Method ◽  
Nonlinear Embedding ◽  
Spectral Regression

Low resolution (LR) in face recognition (FR) surveillance applications will cause the problem of dimensional mismatch between LR image and its high-resolution (HR) template. In this paper, a novel method called kernel coupled cross-regression (KCCR) is proposed to deal with this problem. Instead of processing in the original observing space directly, KCCR projects LR and HR face images into a unified nonlinear embedding feature space using kernel coupled mappings and graph embedding. Spectral regression is further employed to improve the generalization performance and reduce the time complexity. Meanwhile, cross-regression is developed to fully utilize the HR embedding to increase the information of the LR space, thus to improve the recognition performance. Experiments on the FERET and CMU PIE face database show that KCCR outperforms the existing structure-based methods in terms of recognition rate as well as time complexity.

Two-Dimensional Locality Discriminant Preserving Projections for Face Recognition

2010 ◽  
Vol 121-122 ◽  
pp. 391-398 ◽  
Author(s):  
Qi Rong Zhang ◽  
Zhong Shi He
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Recognition Performance ◽  
Recognition Rate ◽  
Image Feature ◽  
Two Dimensional ◽  
Face Database ◽  
Image Feature Extraction ◽  
Locality Preserving Projection ◽  
Locality Preserving

In this paper, we propose a new face recognition approach for image feature extraction named two-dimensional locality discriminant preserving projections (2DLDPP). Two-dimensional locality preserving projections (2DLPP) can direct on 2D image matrixes. So, it can make better recognition rate than locality preserving projection. We investigate its more. The 2DLDPP is to use modified maximizing margin criterion (MMMC) in 2DLPP and set the parameter optimized to maximize the between-class distance while minimize the within-class distance. Extensive experiments are performed on ORL face database and FERET face database. The 2DLDPP method achieves better face recognition performance than PCA, 2DPCA, LPP and 2DLPP.

Face Recognition by PCA and Improved LBP Fusion Algorithm

2015 ◽  
Vol 734 ◽  
pp. 562-567 ◽  
Author(s):  
En Zeng Dong ◽  
Yan Hong Fu ◽  
Ji Gang Tong
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Texture Feature ◽  
Principal Component ◽  
Texture Features ◽  
Rotation Invariant ◽  
Fusion Algorithm ◽  
Face Images ◽  
The Face ◽  
Pca Method

This paper proposed a theoretically efficient approach for face recognition based on principal component analysis (PCA) and rotation invariant uniform local binary pattern texture features in order to weaken the effects of varying illumination conditions and facial expressions. Firstly, the rotation invariant uniform LBP operator was adopted to extract the local texture feature of the face images. Then PCA method was used to reduce the dimensionality of the extracted feature and get the eigenfaces. Finally, the nearest distance classification was used to distinguish each face. The method has been accessed on Yale and ATR-Jaffe face databases. Results demonstrate that the proposed method is superior to standard PCA and its recognition rate is higher than the traditional PCA. And the proposed algorithm has strong robustness against the illumination changes, pose, rotation and expressions.

scholarly journals Online Training for Face Recognition System Using Improved PCA

2011 ◽  
Vol 2 (2) ◽  
pp. 1303
Author(s):  
Widodo Budiharto
Keyword(s):  
Face Recognition ◽  
Stereo Vision ◽  
Indoor Environment ◽  
Online Training ◽  
Recognition System ◽  
Service Robot ◽  
Challenging Problem ◽  
Face Database ◽  
Face Images ◽  
Face Recognition System

The variation in illumination is one of the main challenging problem for face recognition. It has been proven that in face recognition, differences caused by illumination variations are more significant than differences between individuals. Recognizing face reliably across changes in pose and illumination using PCA has proved to be a much harder problem because eigenfaces method comparing the intensity of the pixel. To solve this problem, this research proposes an online face recognition system using improved PCA for a service robot in indoor environment based on stereo vision. Tested images are improved by generating random values for varying the intensity of face images. A program for online training is also developed where the tested images are captured real-time from camera. Varying illumination in tested images will increase the accuracy using ITS face database which its accuracy is 95.5 %, higher than ATT face database’s as 95.4% and Indian face database’s as 72%. The results from this experiment are still evaluated to be improved in the future.

Sign in / Sign up

Export Citation Format

Share Document