scholarly journals Laplace Graph Embedding Class Specific Dictionary Learning for Face Recognition

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Li Wang ◽  
Yan-Jiang Wang ◽  
Bao-Di Liu
Keyword(s):  
Face Recognition ◽  
Dictionary Learning ◽  
Graph Embedding ◽  
Small Sample ◽  
Superior Performance ◽  
Collaborative Representation ◽  
Training Samples ◽  
Arbitrary Kernel ◽  
Fitting Error ◽  
Dictionary Training

The sparse representation based classification (SRC) method and collaborative representation based classification (CRC) method have attracted more and more attention in recent years due to their promising results and robustness. However, both SRC and CRC algorithms directly use the training samples as the dictionary, which leads to a large fitting error. In this paper, we propose the Laplace graph embedding class specific dictionary learning (LGECSDL) algorithm, which trains a weight matrix and embeds a Laplace graph to reconstruct the dictionary. Firstly, it can increase the dimension of the dictionary matrix, which can be used to classify the small sample database. Secondly, it gives different dictionary atoms with different weights to improve classification accuracy. Additionally, in each class dictionary training process, the LGECSDL algorithm introduces the Laplace graph embedding method to the objective function in order to keep the local structure of each class, and the proposed method is capable of improving the performance of face recognition according to the class specific dictionary learning and Laplace graph embedding regularizer. Moreover, we also extend the proposed method to an arbitrary kernel space. Extensive experimental results on several face recognition benchmark databases demonstrate the superior performance of our proposed algorithm.

Virtual samples based robust block-diagonal dictionary learning for face recognition

2021 ◽  
Vol 25 (5) ◽  
pp. 1273-1290
Author(s):  
Shuangxi Wang ◽  
Hongwei Ge ◽  
Jinlong Yang ◽  
Shuzhi Su
Keyword(s):  
Face Recognition ◽  
Dictionary Learning ◽  
Recognition Performance ◽  
Small Sample Size ◽  
Small Sample ◽  
Low Rank ◽  
Negative Effects ◽  
Linear Classifier ◽  
Virtual Samples ◽  
Block Diagonal

It is an open question to learn an over-complete dictionary from a limited number of face samples, and the inherent attributes of the samples are underutilized. Besides, the recognition performance may be adversely affected by the noise (and outliers), and the strict binary label based linear classifier is not appropriate for face recognition. To solve above problems, we propose a virtual samples based robust block-diagonal dictionary learning for face recognition. In the proposed model, the original samples and virtual samples are combined to solve the small sample size problem, and both the structure constraint and the low rank constraint are exploited to preserve the intrinsic attributes of the samples. In addition, the fidelity term can effectively reduce negative effects of noise (and outliers), and the ε-dragging is utilized to promote the performance of the linear classifier. Finally, extensive experiments are conducted in comparison with many state-of-the-art methods on benchmark face datasets, and experimental results demonstrate the efficacy of the proposed method.

scholarly journals Hybrid Collaborative Representation for Remote-Sensing Image Scene Classification

2018 ◽  
Vol 10 (12) ◽  
pp. 1934 ◽  
Author(s):  
Bao-Di Liu ◽  
Wen-Yang Xie ◽  
Jie Meng ◽  
Ye Li ◽  
Yanjiang Wang
Keyword(s):  
Remote Sensing ◽  
Test Sample ◽  
Remote Sensing Image ◽  
Image Features ◽  
Superior Performance ◽  
Collaborative Representation ◽  
Great Success ◽  
Specific Class ◽  
Remote Sensing Images ◽  
Training Samples

In recent years, the collaborative representation-based classification (CRC) method has achieved great success in visual recognition by directly utilizing training images as dictionary bases. However, it describes a test sample with all training samples to extract shared attributes and does not consider the representation of the test sample with the training samples in a specific class to extract the class-specific attributes. For remote-sensing images, both the shared attributes and class-specific attributes are important for classification. In this paper, we propose a hybrid collaborative representation-based classification approach. The proposed method is capable of improving the performance of classifying remote-sensing images by embedding the class-specific collaborative representation to conventional collaborative representation-based classification. Moreover, we extend the proposed method to arbitrary kernel space to explore the nonlinear characteristics hidden in remote-sensing image features to further enhance classification performance. Extensive experiments on several benchmark remote-sensing image datasets were conducted and clearly demonstrate the superior performance of our proposed algorithm to state-of-the-art approaches.

Robust and discriminative dictionary learning for face recognition

2018 ◽  
Vol 16 (02) ◽  
pp. 1840004 ◽  
Author(s):  
Guojun Lin ◽  
Meng Yang ◽  
Linlin Shen ◽  
Mingzhong Yang ◽  
Mei Xie
Keyword(s):  
Face Recognition ◽  
Facial Expressions ◽  
Dictionary Learning ◽  
State Of The Art ◽  
Face Image ◽  
Superior Performance ◽  
Face Images ◽  
Proposed Model ◽  
Classification Capability ◽  
Discriminative Dictionary Learning

For face recognition, conventional dictionary learning (DL) methods have some disadvantages. First, face images of the same person vary with facial expressions and pose, illumination and disguises, so it is hard to obtain a robust dictionary for face recognition. Second, they don’t cover important components (e.g., particularity and disturbance) completely, which limit their performance. In the paper, we propose a novel robust and discriminative DL (RDDL) model. The proposed model uses sample diversities of the same face image to learn a robust dictionary, which includes class-specific dictionary atoms and disturbance dictionary atoms. These atoms can well represent the data from different classes. Discriminative regularizations on the dictionary and the representation coefficients are used to exploit discriminative information, which improves effectively the classification capability of the dictionary. The proposed RDDL is extensively evaluated on benchmark face image databases, and it shows superior performance to many state-of-the-art dictionary learning methods for face recognition.

Nonnegative Sparse Probabilistic Estimation for Single Sample Face Recognition

2020 ◽  
Vol 34 (12) ◽  
pp. 2056008
Author(s):  
Shuhuan Zhao
Keyword(s):  
Face Recognition ◽  
Sparse Representation ◽  
Real Life ◽  
Test Sample ◽  
Single Sample ◽  
Collaborative Representation ◽  
Adaptive Variation ◽  
Training Set ◽  
Probabilistic Estimation ◽  
Training Samples

Face recognition (FR) is a hotspot in pattern recognition and image processing for its wide applications in real life. One of the most challenging problems in FR is single sample face recognition (SSFR). In this paper, we proposed a novel algorithm based on nonnegative sparse representation, collaborative presentation, and probabilistic graph estimation to address SSFR. The proposed algorithm is named as Nonnegative Sparse Probabilistic Estimation (NNSPE). To extract the variation information from the generic training set, we first select some neighbor samples from the generic training set for each sample in the gallery set and the generic training set can be partitioned into some reference subsets. To make more meaningful reconstruction, the proposed method adopts nonnegative sparse representation to reconstruct training samples, and according to the reconstruction coefficients, NNSPE computes the probabilistic label estimation for the samples of the generic training set. Then, for a given test sample, collaborative representation (CR) is used to acquire an adaptive variation subset. Finally, the NNSPE classifies the test sample with the adaptive variation subset and probabilistic label estimation. The experiments on the AR and PIE verify the effectiveness of the proposed method both in recognition rates and time cost.

scholarly journals Fusing Two Kinds of Virtual Samples for Small Sample Face Recognition

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Minna Qiu ◽  
Jian Zhang ◽  
Jiayan Yang ◽  
Liying Ye
Keyword(s):  
Face Recognition ◽  
Test Sample ◽  
Recognition System ◽  
Training Sample ◽  
Small Sample ◽  
Storage Space ◽  
Training Sample Size ◽  
Face Recognition System ◽  
Training Samples ◽  
Virtual Samples

Face recognition has become a very active field of biometrics. Different pictures of the same face might include various changes of expressions, poses, and illumination. However, a face recognition system usually suffers from the problem that nonsufficient training samples cannot convey these possible changes effectively. The main reason is that a system has only limited storage space and limited time to capture training samples. Many previous literatures ignored the problem of nonsufficient training samples. In this paper, we overcome the insufficiency of training sample size problem by fusing two kinds of virtual samples and the original samples to perform small sample face recognition. The two used kinds of virtual samples are mirror faces and symmetrical faces. Firstly, we transform the original face image to obtain mirror faces and symmetrical faces. Secondly, we fuse these two kinds of virtual samples to achieve the matching scores between the test sample and each class. Finally, we integrate the matching scores to get the final classification results. We compare the proposed method with the single virtual sample augment methods and the original representation-based classification. The experiments on various face databases show that the proposed scheme achieves the best accuracy among the representation-based classification methods.

scholarly journals Learning Kernel-Based Robust Disturbance Dictionary for Face Recognition

2019 ◽  
Vol 9 (6) ◽  
pp. 1189 ◽  
Author(s):  
Biwei Ding ◽  
Hua Ji
Keyword(s):  
Face Recognition ◽  
Discriminant Analysis ◽  
Principal Components ◽  
Dictionary Learning ◽  
Recognition Rate ◽  
Computation Time ◽  
Kernel Discriminant Analysis ◽  
Training Samples ◽  
Sparse Representation Classifier ◽  
Facial Changes

In this paper, a kernel-based robust disturbance dictionary (KRDD) is proposed for face recognition that solves the problem in modern dictionary learning in which significant components of signal representation cannot be entirely covered. KRDD can effectively extract the principal components of the kernel by dimensionality reduction. KRDD not only performs well with occluded face data, but is also good at suppressing intraclass variation. KRDD learns the robust disturbance dictionaries by extracting and generating the diversity of comprehensive training samples generated by facial changes. In particular, a basic dictionary, a real disturbance dictionary, and a simulated disturbance dictionary are acquired to represent data from distinct subjects to fully represent commonality and disturbance. Two of the disturbance dictionaries are modeled by learning few kernel principal components of the disturbance changes, and then the corresponding dictionaries are obtained by kernel discriminant analysis (KDA) projection modeling. Finally, extended sparse representation classifier (SRC) is used for classification. In the experimental results, KRDD performance displays great advantages in recognition rate and computation time compared with many of the most advanced dictionary learning methods for face recognition.

Using the original and symmetrical face training samples to perform collaborative representation for face recognition

Optik ◽  
2016 ◽  
Vol 127 (4) ◽  
pp. 1900-1904 ◽  
Author(s):  
Zhonghua Liu ◽  
Jiexin Pu ◽  
Qingtao Wu ◽  
Xuhui Zhao
Keyword(s):  
Face Recognition ◽  
Collaborative Representation ◽  
Training Samples

scholarly journals Patch Based Collaborative Representation with Gabor Feature and Measurement Matrix for Face Recognition

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Zhengyuan Xu ◽  
Yu Liu ◽  
Mingquan Ye ◽  
Lei Huang ◽  
Hao Yu ◽  
...  
Keyword(s):  
Face Recognition ◽  
Sample Size ◽  
Small Sample Size ◽  
Large Data ◽  
Linear Representation ◽  
Small Sample ◽  
Collaborative Representation ◽  
Measurement Matrix ◽  
Gabor Feature ◽  
The Impact

In recent years, sparse representation based classification (SRC) has emerged as a popular technique in face recognition. Traditional SRC focuses on the role of the l1-norm but ignores the impact of collaborative representation (CR), which employs all the training examples over all the classes to represent a test sample. Due to issues like expression, illumination, pose, and small sample size, face recognition still remains as a challenging problem. In this paper, we proposed a patch based collaborative representation method for face recognition via Gabor feature and measurement matrix. Using patch based collaborative representation, this method can solve the problem of the lack of accuracy for the linear representation of the small sample size. Compared with holistic features, the multiscale and multidirection Gabor feature shows more robustness. The usage of measurement matrix can reduce large data volume caused by Gabor feature. The experimental results on several popular face databases including Extended Yale B, CMU_PIE, and LFW indicated that the proposed method is more competitive in robustness and accuracy than conventional SR and CR based methods.

scholarly journals Score level fusion in representation-based classification method for face recognition

2020 ◽  
Vol 14 ◽  
pp. 174830262093094
Author(s):  
Zi-Qi Li ◽  
Jun Sun ◽  
Xiao-Jun Wu ◽  
He-Feng Yin
Keyword(s):  
Face Recognition ◽  
Least Square ◽  
Classification Method ◽  
Collaborative Representation ◽  
Score Level Fusion ◽  
Training Samples ◽  
Global Representation ◽  
Face Datasets ◽  
Representation Method ◽  
Level Fusion

Recent years have witnessed the success of representation-based classification method (RBCM) in the domain of face recognition. Collaborative representation-based classification (CRC) and linear regression-based classification (LRC) are two representative approaches. CRC is a global representation method which uses all training samples to represent test samples and utilizes representation residuals to perform classification, whereas LRC is a local representation method which exploits training samples from each class to represent test samples. Related researches indicate that the combination of LRC and CRC can fully exploit the representation residuals produced by them, thus improving the performance of RBCM. However, the representation coefficients obtained by CRC usually contain negative values which may result in overfitting problem. Therefore, to solve this problem to some extent, the combination of LRC and non-negative least square-based classification (NNLSC) is proposed in this paper. Experimental results on benchmark face datasets show that the proposed method is superior to the combination of LRC and CRC and other state-of-the-art RBCMs. The source code of our proposed method is available at https://github.com/li-zi-qi/score-level-fusion-of-NNLS-and-LRC .

Test Sample Oriented Dictionary Learning for Face Recognition

2016 ◽  
Vol 25 (04) ◽  
pp. 1650017 ◽  
Author(s):  
Zhengming Li
Keyword(s):  
Face Recognition ◽  
Dictionary Learning ◽  
Sparse Coding ◽  
State Of The Art ◽  
Linear Representation ◽  
Test Sample ◽  
Basic Model ◽  
Linear Classifier ◽  
Learning Procedure ◽  
Training Samples

Dictionary learning (DL) algorithms have shown very good performance in face recognition. However, conventional DL algorithms exploit only the training samples to obtain the dictionary and totally neglect the test sample in the learning procedure. As a result, if DL is associated with the linear representation of test sample, DL may be able to perform better in classifying the test samples than conventional DL algorithms. In this paper, we propose a test sample oriented dictionary learning (TSODL) algorithm for face recognition. We combine the linear representation (including the [Formula: see text]-norm, [Formula: see text]-norm and [Formula: see text]-norm) of a test sample and the basic model of DL to learn a single dictionary for each test sample. Thus, it can simultaneously obtain the dictionary and representation coefficients of the test sample by minimizing only one objective function. In order to make the learning procedure more efficient, we initialize a dictionary for the new test sample by selecting from the dictionaries of previous test samples. The experimental results show that the TSODL algorithm can classify test samples more accurately than some of the state-of-the-art DL and sparse coding algorithms by using a linear classifier method on three public face databases.

Sign in / Sign up

Export Citation Format

Share Document