scholarly journals Direct Neighborhood Discriminant Analysis for Face Recognition

2008 ◽  
Vol 2008 ◽  
pp. 1-15
Author(s):  
Miao Cheng ◽  
Bin Fang ◽  
Yuan Yan Tang ◽  
Jing Wen
Keyword(s):  
Face Recognition ◽  
Discriminant Analysis ◽  
Structure Learning ◽  
Geometrical Structure ◽  
High Dimensional ◽  
Computation Complexity ◽  
Dimensional Representation ◽  
Face Images ◽  
Low Dimensional ◽  
Class Geometry

Face recognition is a challenging problem in computer vision and pattern recognition. Recently, many local geometrical structure-based techiniques are presented to obtain the low-dimensional representation of face images with enhanced discriminatory power. However, these methods suffer from the small simple size (SSS) problem or the high computation complexity of high-dimensional data. To overcome these problems, we propose a novel local manifold structure learning method for face recognition, named direct neighborhood discriminant analysis (DNDA), which separates the nearby samples of interclass and preserves the local within-class geometry in two steps, respectively. In addition, the PCA preprocessing to reduce dimension to a large extent is not needed in DNDA avoiding loss of discriminative information. Experiments conducted on ORL, Yale, and UMIST face databases show the effectiveness of the proposed method.

scholarly journals An Incremental Version of L-MVU for the Feature Extraction of MI-EEG

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Mingai Li ◽  
Hongwei Xi ◽  
Xiaoqing Zhu
Keyword(s):  
Feature Extraction ◽  
Extraction Method ◽  
Average Energy ◽  
High Dimensional ◽  
Dimensional Representation ◽  
Feature Extraction Method ◽  
Sample Data ◽  
Out Of Sample ◽  
Nonlinear Features ◽  
Low Dimensional

Due to the nonlinear and high-dimensional characteristics of motor imagery electroencephalography (MI-EEG), it can be challenging to get high online accuracy. As a nonlinear dimension reduction method, landmark maximum variance unfolding (L-MVU) can completely retain the nonlinear features of MI-EEG. However, L-MVU still requires considerable computation costs for out-of-sample data. An incremental version of L-MVU (denoted as IL-MVU) is proposed in this paper. The low-dimensional representation of the training data is generated by L-MVU. For each out-of-sample data, its nearest neighbors will be found in the high-dimensional training samples and the corresponding reconstruction weight matrix be calculated to generate its low-dimensional representation as well. IL-MVU is further combined with the dual-tree complex wavelet transform (DTCWT), which develops a hybrid feature extraction method (named as IL-MD). IL-MVU is applied to extract the nonlinear features of the specific subband signals, which are reconstructed by DTCWT and have the obvious event-related synchronization/event-related desynchronization phenomenon. The average energy features of α and β waves are calculated simultaneously. The two types of features are fused and are evaluated by a linear discriminant analysis classifier. Based on the two public datasets with 12 subjects, extensive experiments were conducted. The average recognition accuracies of 10-fold cross-validation are 92.50% on Dataset 3b and 88.13% on Dataset 2b, and they gain at least 1.43% and 3.45% improvement, respectively, compared to existing methods. The experimental results show that IL-MD can extract more accurate features with relatively lower consumption cost, and it also has better feature visualization and self-adaptive characteristics to subjects. The t-test results and Kappa values suggest the proposed feature extraction method reaches statistical significance and has high consistency in classification.

scholarly journals Membership-Degree Preserving Discriminant Analysis with Applications to Face Recognition

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Zhangjing Yang ◽  
Chuancai Liu ◽  
Pu Huang ◽  
Jianjun Qian
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Discriminant Analysis ◽  
Nearest Neighbor ◽  
High Dimensional ◽  
Membership Degree ◽  
Extraction Techniques ◽  
Fisher Criterion ◽  
Extraction Algorithm ◽  
Definition Of

In pattern recognition, feature extraction techniques have been widely employed to reduce the dimensionality of high-dimensional data. In this paper, we propose a novel feature extraction algorithm called membership-degree preserving discriminant analysis (MPDA) based on the fisher criterion and fuzzy set theory for face recognition. In the proposed algorithm, the membership degree of each sample to particular classes is firstly calculated by the fuzzyk-nearest neighbor (FKNN) algorithm to characterize the similarity between each sample and class centers, and then the membership degree is incorporated into the definition of the between-class scatter and the within-class scatter. The feature extraction criterion via maximizing the ratio of the between-class scatter to the within-class scatter is applied. Experimental results on the ORL, Yale, and FERET face databases demonstrate the effectiveness of the proposed algorithm.

scholarly journals Multiple Data-Dependent Kernel Fisher Discriminant Analysis for Face Recognition

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yue Liu ◽  
Yibing Li ◽  
Hong Xie ◽  
Dandan Liu
Keyword(s):  
Face Recognition ◽  
Discriminant Analysis ◽  
Facial Features ◽  
Fisher Criterion ◽  
Fisher Discriminant Analysis ◽  
Fisher Discriminant ◽  
Face Images ◽  
Kernel Fisher Discriminant Analysis ◽  
Multiple Data ◽  
Novel Algorithm

Kernel Fisher discriminant analysis (KFDA) method has demonstrated its success in extracting facial features for face recognition. Compared to linear techniques, it can better describe the complex and nonlinear variations of face images. However, a single kernel is not always suitable for the applications of face recognition which contain data from multiple, heterogeneous sources, such as face images under huge variations of pose, illumination, and facial expression. To improve the performance of KFDA in face recognition, a novel algorithm named multiple data-dependent kernel Fisher discriminant analysis (MDKFDA) is proposed in this paper. The constructed multiple data-dependent kernel (MDK) is a combination of several base kernels with a data-dependent kernel constraint on their weights. By solving the optimization equation based on Fisher criterion and maximizing the margin criterion, the parameter optimization of data-dependent kernel and multiple base kernels is achieved. Experimental results on the three face databases validate the effectiveness of the proposed algorithm.

scholarly journals Locally Linear Discriminate Embedding for Face Recognition

2009 ◽  
Vol 2009 ◽  
pp. 1-8 ◽  
Author(s):  
Eimad E. Abusham ◽  
E. K. Wong
Keyword(s):  
Face Recognition ◽  
Dimensional Space ◽  
Linear Structure ◽  
Data Representation ◽  
High Dimensional ◽  
Fast Processing ◽  
Novel Method ◽  
Computational Simplicity ◽  
Low Dimensional ◽  
Locally Linear

A novel method based on the local nonlinear mapping is presented in this research. The method is called Locally Linear Discriminate Embedding (LLDE). LLDE preserves a local linear structure of a high-dimensional space and obtains a compact data representation as accurately as possible in embedding space (low dimensional) before recognition. For computational simplicity and fast processing, Radial Basis Function (RBF) classifier is integrated with the LLDE. RBF classifier is carried out onto low-dimensional embedding with reference to the variance of the data. To validate the proposed method, CMU-PIE database has been used and experiments conducted in this research revealed the efficiency of the proposed methods in face recognition, as compared to the linear and non-linear approaches.

Implementation of Parallel Lanczos Method for Intrusion Detection with Cloud Technologies

2013 ◽  
Vol 303-306 ◽  
pp. 2412-2415
Author(s):  
Bo Chen ◽  
Yu Le Deng ◽  
Tie Ming Chen
Keyword(s):  
Intrusion Detection ◽  
Dimensionality Reduction ◽  
Input Data ◽  
Lanczos Method ◽  
Map Reduce ◽  
High Dimensional ◽  
Dimensional Representation ◽  
Low Dimensional ◽  
Pca Algorithm ◽  
Cloud Technologies

The aim of dimensionality reduction is to construct a low-dimensional representation of high dimensional input data in such a way, that important parts of the structure of the input data are preserved. This paper proposes to apply the dimensionality reduction to intrusion detection data based on the parallel Lanczos-SVD (PLSVD) with the cloud technologies. The massive input data is stored on distribution files system, like HDFS. And the Map/Reduce method is used for the parallel analysis on many cluster nodes. Our experiment results show that, compared with the PCA algorithm, PLSVD algorithm has better scalability and flexibility.

DISCRIMINATIVE LOCAL LEARNING PROJECTION FOR FACE RECOGNITION

2011 ◽  
Vol 25 (01) ◽  
pp. 83-97 ◽  
Author(s):  
YU CHEN ◽  
JIAN HUANG ◽  
XIAOHONG XU ◽  
JIANHUANG LAI
Keyword(s):  
Face Recognition ◽  
Local Structure ◽  
Estimation Error ◽  
Subspace Learning ◽  
High Dimensional ◽  
Local Geometry ◽  
Local Learning ◽  
Learning Method ◽  
Local Structures ◽  
Face Images

Subspace learning method has commonly been used as a popular way to understand high dimensional data such as face images. In this paper, a novel subspace learning method called Discriminative Local Learning Projection (DLLP) is proposed for face recognition. By characterizing the local structures and dissimilarities between the supervised data manifolds, a linear transformation that can maximize the dissimilarities between all manifolds and simultaneously minimize the local estimation error can be computed. Thus the proposed algorithm embeds the discriminative information as well as the local geometry of samples into the objective function. And the abilities of preserving the local structure in each manifold and classification are both combined into the algorithm. Extensive experiments on face databases demonstrate the effectiveness of DLLP.

scholarly journals Adaptive Deep Supervised Autoencoder Based Image Reconstruction for Face Recognition

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Rongbing Huang ◽  
Chang Liu ◽  
Guoqi Li ◽  
Jiliu Zhou
Keyword(s):  
Deep Learning ◽  
Face Recognition ◽  
Image Reconstruction ◽  
Face Images ◽  
Reconstruction Image ◽  
Label Information ◽  
Bottleneck Neural Network ◽  
Characteristic Features ◽  
Low Dimensional ◽  
Facial Images

Based on a special type of denoising autoencoder (DAE) and image reconstruction, we present a novel supervised deep learning framework for face recognition (FR). Unlike existing deep autoencoder which is unsupervised face recognition method, the proposed method takes class label information from training samples into account in the deep learning procedure and can automatically discover the underlying nonlinear manifold structures. Specifically, we define an Adaptive Deep Supervised Network Template (ADSNT) with the supervised autoencoder which is trained to extract characteristic features from corrupted/clean facial images and reconstruct the corresponding similar facial images. The reconstruction is realized by a so-called “bottleneck” neural network that learns to map face images into a low-dimensional vector and reconstruct the respective corresponding face images from the mapping vectors. Having trained the ADSNT, a new face image can then be recognized by comparing its reconstruction image with individual gallery images, respectively. Extensive experiments on three databases including AR, PubFig, and Extended Yale B demonstrate that the proposed method can significantly improve the accuracy of face recognition under enormous illumination, pose change, and a fraction of occlusion.

SUBSPACE-BASED FACE RECOGNITION: OUTLIER DETECTION AND A NEW DISTANCE CRITERION

2005 ◽  
Vol 19 (04) ◽  
pp. 479-493 ◽  
Author(s):  
PEI CHEN ◽  
DAVID SUTER
Keyword(s):  
Face Recognition ◽  
Outlier Detection ◽  
Principal Component ◽  
Dimensional Subspace ◽  
Recognition Algorithm ◽  
New Techniques ◽  
Face Images ◽  
The Face ◽  
Low Dimensional ◽  
New Strategies

Illumination effects, including shadows and varying lighting, make the problem of face recognition challenging. Experimental and theoretical results show that the face images under different illumination conditions approximately lie in a low-dimensional subspace, hence principal component analysis (PCA) or low-dimensional subspace techniques have been used. Following this spirit, we propose new techniques for the face recognition problem, including an outlier detection strategy (mainly for those points not following the Lambertian reflectance model), and a new error criterion for the recognition algorithm. Experiments using the Yale-B face database show the effectiveness of the new strategies.

Sign in / Sign up

Export Citation Format

Share Document