SUPERVISED REGULARIZATION LOCALITY-PRESERVING PROJECTION METHOD FOR FACE RECOGNITION

2012 ◽  
Vol 10 (06) ◽  
pp. 1250053 ◽  
Author(s):  
WEN-SHENG CHEN ◽  
WEI WANG ◽  
JIAN-WEI YANG ◽  
YUAN YAN TANG
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Small Sample Size ◽  
Small Sample ◽  
Superior Performance ◽  
Locality Preserving Projection ◽  
Feature Extraction Method ◽  
Linear Feature ◽  
Linear Feature Extraction ◽  
Locality Preserving

Locality-preserving projection (LPP) is a promising manifold-based dimensionality reduction and linear feature extraction method for face recognition. However, there exist two main issues in traditional LPP algorithm. LPP does not utilize the class label information at the training stage and its performance will be affected for classification tasks. In addition, LPP often suffers from small sample size (3S) problem, which occurs when the dimension of input pattern space is greater than the number of training samples. Under this situation, LPP fails to work. To overcome these two limitations, this paper presents a novel supervised regularization LPP (SRLPP) approach based on a supervised graph and a new regularization strategy. It theoretically proves that regularization matrix [Formula: see text] approaches to the original one as the regularized parameter tends to zero. The proposed SRLPP method is subsequently applied to face recognition. The experiments are conducted on two publicly available face databases, namely ORL database and FERET database. Compared with some existing LDA-based and LPP-based linear feature extraction approaches, experimental results show that our SRLPP approach gives superior performance.

scholarly journals An Efficient Feature Extraction Method, Global Between Maximum and Local Within Minimum, and Its Applications

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Lei Wang ◽  
Jiangshe Zhang ◽  
Fei Zang
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Extraction Method ◽  
Small Sample Size ◽  
Small Sample ◽  
Local Geometry ◽  
Excellent Performance ◽  
Data Set ◽  
Feature Extraction Method ◽  
Nearest Neighborhood

Feature extraction plays an important role in preprocessing procedure in dealing with small sample size problems. Considering the fact that LDA, LPP, and many other existing methods are confined to one case of the data set. To solve this problem, we propose an efficient method in this paper, named global between maximum and local within minimum. It not only considers the global structure of the data set, but also makes the best of the local geometry of the data set through dividing the data set into four domains. This method preserves relations of the nearest neighborhood, as well as demonstrates an excellent performance in classification. Superiority of the proposed method in this paper is manifested in many experiments on data visualization, face representative, and face recognition.

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.

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.

NEAREST NEIGHBOR DISCRIMINANT ANALYSIS

2006 ◽  
Vol 20 (08) ◽  
pp. 1245-1259 ◽  
Author(s):  
XIPENG QIU ◽  
LIDE WU
Keyword(s):  
Feature Extraction ◽  
Discriminant Analysis ◽  
Nearest Neighbor ◽  
Small Sample Size ◽  
Small Sample ◽  
Real World Data ◽  
Scatter Matrix ◽  
Linear Discriminant ◽  
Feature Extraction Method ◽  
Gaussian Density

Linear Discriminant Analysis (LDA) is a popular feature extraction technique in statistical pattern recognition. However, it often suffers from the small sample size problem when dealing with high-dimensional data. Moreover, while LDA is guaranteed to find the best directions when each class has a Gaussian density with a common covariance matrix, it can fail if the class densities are more general. In this paper, a novel nonparametric linear feature extraction method, nearest neighbor discriminant analysis (NNDA), is proposed from the view of the nearest neighbor classification. NNDA finds the important discriminant directions without assuming the class densities belong to any particular parametric family. It does not depend on the nonsingularity of the within-class scatter matrix either. Then we give an approximate approach to optimize NNDA and an extension to k-NN. We apply NNDA to the simulated data and real world data, the results demonstrate that NNDA outperforms the existing variant LDA methods.

Ant-Snake model for Linear Feature Extraction from Satellite Image

2014 ◽  
Vol 13 (6) ◽  
pp. 4574-4582
Author(s):  
Jalal Amini ◽  
Leila Mohammadnia
Keyword(s):  
Feature Extraction ◽  
Satellite Images ◽  
Satellite Image ◽  
Ant Colony ◽  
Superior Performance ◽  
Linear Features ◽  
Snake Model ◽  
Parametric Curve ◽  
Linear Feature ◽  
Linear Feature Extraction

This paper proposes an optimized mathematical model for linear feature extraction from satellite images. The model is based on a developed ant colony model combined with the snake model (called Ant-Snake model) to identify and extract the linear features like roads from satellite images. The process is started with the developed ant colony model to recognize and identify interest object and then with a snake model extract object. The developed ant model is able to establish a pheromone matrix that represents the object information at each pixel position of the image, according to the movements of a number of ants which are dispatch to move on the image. And the snake model is a parametric curve which is allowed to deform from some arbitrary initial locations from pheromone matrix toward the desired final location by minimizing an energy function. Experimental results are provided to demonstrate the superior performance of the proposed approach.

WAVELET-FACE BASED SUBSPACE LDA METHOD TO SOLVE SMALL SAMPLE SIZE PROBLEM IN FACE RECOGNITION

2009 ◽  
Vol 07 (02) ◽  
pp. 199-214 ◽  
Author(s):  
WEN-SHENG CHEN ◽  
JIAN HUANG ◽  
JIN ZOU ◽  
BIN FANG
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Dimensionality Reduction ◽  
Sample Size ◽  
Null Space ◽  
Small Sample Size ◽  
Small Sample ◽  
Projection Matrix ◽  
Scatter Matrix ◽  
Linear Discriminant

Linear Discriminant Analysis (LDA) is a popular statistical method for both feature extraction and dimensionality reduction in face recognition. The major drawback of LDA is the so-called small sample size (3S) problem. This problem always occurs when the total number of training samples is smaller than the dimension of feature space. Under this situation, the within-class scatter matrix Sw becomes singular and LDA approach cannot be implemented directly. To overcome the 3S problem, this paper proposes a novel wavelet-face based subspace LDA algorithm. Wavelet-face feature extraction and dimensionality reduction are based on two-level D4-filter wavelet transform and discarding the null space of total class scatter matrix St. It is shown that our obtained projection matrix satisfies the uncorrelated constraint conditions. Hence in the sense of statistical uncorrelation, this projection matrix is optimal. The proposed method for face recognition has been evaluated with two public available databases, namely ORL and FERET databases. Comparing with existing LDA-based methods to solve the 3S problem, our method gives the best performance.

EFFICIENT PSEUDOINVERSE LINEAR DISCRIMINANT ANALYSIS AND ITS NONLINEAR FORM FOR FACE RECOGNITION

2007 ◽  
Vol 21 (08) ◽  
pp. 1265-1278 ◽  
Author(s):  
JUN LIU ◽  
SONGCAN CHEN ◽  
XIAOYANG TAN ◽  
DAOQIANG ZHANG
Keyword(s):  
Face Recognition ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
Small Sample Size ◽  
Classification Performance ◽  
Small Sample ◽  
Linear Discriminant ◽  
Feature Extraction Method ◽  
New Feature ◽  
And Storage

Pseudoinverse Linear Discriminant Analysis (PLDA) is a classical and pioneer method that deals with the Small Sample Size (SSS) problem in LDA when applied to such applications as face recognition. However, it is expensive in computation and storage due to direct manipulation on extremely large d × d matrices, where d is the dimension of the sample image. As a result, although frequently cited in literature, PLDA is hardly compared in terms of classification performance with the newly proposed methods. In this paper, we propose a new feature extraction method named RSw + LDA, which is (1) much more efficient than PLDA in both computation and storage; and (2) theoretically equivalent to PLDA, meaning that it produces the same projection matrix as PLDA. Further, to make PLDA deal better with data of nonlinear distribution, we propose a Kernel PLDA (KPLDA) method with the well-known kernel trick. Finally, our experimental results on AR face dataset, a challenging dataset with variations in expression, lighting and occlusion, show that PLDA (or RSw + LDA) can achieve significantly higher classification accuracy than the recently proposed Linear Discriminant Analysis via QR decomposition and Discriminant Common Vectors, and KPLDA can yield better classification performance compared to PLDA and Kernel PCA.

Face Recognition Based on Rearranged Modular Two-Dimensional Locality Preserving Projection

2018 ◽  
Vol 32 (12) ◽  
pp. 1856016 ◽  
Author(s):  
Huxidan Jumahong ◽  
Gulnaz Alimjan
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Projection Algorithm ◽  
Two Dimensional ◽  
Spatial Structures ◽  
Locality Preserving Projection ◽  
Face Images ◽  
Locality Preserving ◽  
Local Block ◽  
Novel Algorithm

This paper proposes a novel algorithm for feature extraction for face recognition, namely the rearranged modular two-dimensional locality preserving projection (Rm2DLPP). In the proposed algorithm, the original images are first divided into modular blocks, then the subblocks are rearranged to form two-dimensional matrices and finally the two-dimensional locality preserving projection algorithm is applied directly on the arranged matrices. The advantage of the Rm2DLPP algorithm is that it can utilize the local block features and global spatial structures of 2D face images simultaneously. The performance of the proposed method is evaluated and compared with other face recognition methods on the ORL, AR and FERET databases. The experimental results demonstrate the effectiveness and superiority of the proposed approach.

scholarly journals Structural Damage Classification in a Jacket-Type Wind-Turbine Foundation Using Principal Component Analysis and Extreme Gradient Boosting

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2748
Author(s):  
Jersson X. Leon-Medina ◽  
Maribel Anaya ◽  
Núria Parés ◽  
Diego A. Tibaduiza ◽  
Francesc Pozo
Keyword(s):  
Principal Component Analysis ◽  
Feature Extraction ◽  
Wind Turbine ◽  
Structural Damage ◽  
Principal Component ◽  
Gradient Boosting ◽  
Damage Classification ◽  
Linear Feature ◽  
Linear Feature Extraction ◽  
Extreme Gradient Boosting

Damage classification is an important topic in the development of structural health monitoring systems. When applied to wind-turbine foundations, it provides information about the state of the structure, helps in maintenance, and prevents catastrophic failures. A data-driven pattern-recognition methodology for structural damage classification was developed in this study. The proposed methodology involves several stages: (1) data acquisition, (2) data arrangement, (3) data normalization through the mean-centered unitary group-scaling method, (4) linear feature extraction, (5) classification using the extreme gradient boosting machine learning classifier, and (6) validation applying a 5-fold cross-validation technique. The linear feature extraction capabilities of principal component analysis are employed; the original data of 58,008 features is reduced to only 21 features. The methodology is validated with an experimental test performed in a small-scale wind-turbine foundation structure that simulates the perturbation effects caused by wind and marine waves by applying an unknown white noise signal excitation to the structure. A vibration-response methodology is selected for collecting accelerometer data from both the healthy structure and the structure subjected to four different damage scenarios. The datasets are satisfactorily classified, with performance measures over 99.9% after using the proposed damage classification methodology.

Sign in / Sign up

Export Citation Format

Share Document