Adaptive generic learning for face recognition from a single sample per person

Face Recognition (FR) problem is one of the significant fields in computer vision. FR is used to identify the faces that appear over distributed cameras over the network. The problem of face recognition can be divided into two categories, the first is recognition with more than one sample per person, which can be called traditional face recognition problem. The second is the recognition of faces using only a Single Sample Per Person (SSPP). The efficiency of face recognition systems decreases because of limited references especially (SSPP) and faces taken in the Operational Domain (OD) different from faces in the Enrollment Domain (ED) in illumination, pose, low-resolution, and blurriness. This paper proposed a method that deals with all problems related to face recognition with SSPP. 3D face reconstruction is used to increase the reference gallery set with different poses and generate a design domain dictionary to overcome the problem of limited reference. Besides, the design domain dictionary is used to feed different deep learning models. Face illumination transfer techniques are utilized to overcome the illumination problem. Labeled Faces in the Wild (LFW) dataset is used to train Super-Resolution Generative Adversarial Network (SRGAN) to overcome the low-resolution problem. Deblur Generative Adversarial Network (DeblurGAN) is trained on the LFW dataset to overcome the problem of blurriness. The proposed method is evaluated using the Chokepoint dataset and COX-S2V dataset. The final results confirm an overall enhancement in accuracy compared to techniques that use SSPP for face recognition (generic learning and face synthesizing approaches). Also, the proposed method outperforms of Traditional and Deep Learning (TDL) method accuracy, which uses SSPP for face recognition.

Multi-level dynamic error coding for face recognition with a contaminated single sample per person

Due to the absence of samples with intra-class variation, extracting discriminative facial features and building powerful classifiers are the bottlenecks of improving the performance of face recognition (FR) with single sample per person (SSPP). In this paper, we propose to learn regional adaptive convolution features which are locally and globally discriminative to face identity and robust to face variation. With collected generic facial variations, a novel class-level joint representation framework is presented to exploit the distinctiveness and class-level commonality of different facial features. In the proposed class-level joint representation with regional adaptive convolution feature (CJR-RACF), both discriminative facial features robust to various facial variations and powerful representation for classification with generic facial variations that can overcome the small-sample-size problem are fully exploited. CJR-RACF has been evaluated on several popular databases, including large-scale CMU Multi-PIE and LFW databases. Experimental results demonstrate the much higher robustness and effectiveness of CJR-RACF to complex facial variations compared to the state-of-the-art methods.

Joint and collaborative representation with local adaptive convolution feature for face recognition with single sample per person

Constrained [formula omitted]-optimal sparse representation technique for face recognition

Face recognition is one of the most fundamental functions for many kinds of intelligent robots. Among many methods proposed for face recognition, linear approaches such as Eigenface or principal component analysis (PCA), Fisher’s linear discriminant (FLD), Fisherface, and common vector (CV), have attracted great attention because of their simplicity. It is known that when the number of training examples is large enough, we should use FLD; otherwise, we should use CV. This paper proposes a rough common vector (RCV) approach. The basic idea of RCV is to divide the feature space into two subspaces. One is spanned by the eigenvectors corresponding to the largest eigenvalues of the within-class scatter matrix, and another is spanned by the eigenvectors corresponding to the smallest eigenvalues. The later plays the role of the null space of the within-class scatter matrix, and is important for extracting useful discriminative features for recognition. RCV can be used regardless the within-class scatter matrix is singular or not. Experimental results on four databases show that RCV outperforms nearest neighbor classifier, Eigenface, Fisherface, and CV in most cases.

The issue of single sample per person (SSPP) face recognition has attracted more and more attention in recent years. Patch/local-based algorithm is one of the most popular categories to address the issue, as patch/local features are robust to face image variations. However, the global discriminative information is ignored in patch/local-based algorithm, which is crucial to recognize the nondiscriminative region of face images. To make the best of the advantage of both local information and global information, a novel two-layer local-to-global feature learning framework is proposed to address SSPP face recognition. In the first layer, the objective-oriented local features are learned by a patch-based fuzzy rough set feature selection strategy. The obtained local features are not only robust to the image variations, but also usable to preserve the discrimination ability of original patches. Global structural information is extracted from local features by a sparse autoencoder in the second layer, which reduces the negative effect of nondiscriminative regions. Besides, the proposed framework is a shallow network, which avoids the over-fitting caused by using multilayer network to address SSPP problem. The experimental results have shown that the proposed local-to-global feature learning framework can achieve superior performance than other state-of-the-art feature learning algorithms for SSPP face recognition.

In this paper, an adaptive approximation image reconstruction method based on orthogonal triangular with column pivoting (QRCP) decomposition algorithm is proposed for single sample problem in face recognition. By using QRCP the single sample and its transpose are decomposed to two sets of basis images. Then an adaptive approximation image reconstruction method is proposed to reconstruct two approximation images from the two basis image sets respectively. The single training sample and its two approximation images of each object form a new training set, which can make the fisher linear discriminant analysis (FLDA) be applied to single sample problem in face recognition. The performance of the proposed method is verified on Yale, FERET, and ORL face databases. The experimental results indicate that the proposed method is efficient and outperforms some existing methods which are proposed to overcome the single sample problem.

As an effective technique for feature extraction and pattern classification Fisher linear discriminant (FLD) has been successfully applied in many fields. However, for a task with very high-dimensional data such as face images, conventional FLD technique encounters a fundamental difficulty caused by singular within-class scatter matrix. To avoid the trouble, many improvements on the feature extraction aspect of FLD have been proposed. In contrast, studies on the pattern classification aspect of FLD are quiet few. In this paper, we will focus our attention on the possible improvement on the pattern classification aspect of FLD by presenting a novel linear discriminant criterion called maximum scatter difference (MSD). Theoretical analysis demonstrates that MSD criterion is a generalization of Fisher discriminant criterion, and is the asymptotic form of discriminant criterion: large margin linear projection. The performance of MSD classifier is tested in face recognition. Experiments performed on the ORL, Yale, FERET and AR databases show that MSD classifier can compete with top-performance linear classifiers such as linear support vector machines, and is better than or equivalent to combinations of well known facial feature extraction methods, such as eigenfaces, Fisherfaces, orthogonal complementary space, nullspace, direct linear discriminant analysis, and the nearest neighbor classifier.

Face recognition (FR) with a single sample per person (SSPP) is one of the most challenging problems in computer vision. In this scenario, it is difficult to predict facial variation such as pose, illumination, and disguise due to the lack of enough training samples. Therefore, the development of the FR system with only a small number of training samples is hindered. To address this problem, this paper proposes a scheme combined transfer learning and sample expansion in feature space. First, it uses transfer learning by training a deep convolutional neural network on a common multi-sample face dataset and then applies the well-trained model to a target data set. Second, it proposes a sample expansion method in feature space called k class feature transfer (KCFT) to enrich intra-class variation information for a single-sample face feature. Compared with other expanding sample methods in the image domain, this method of expanding the samples in the feature domain is novel and easy to implement. Third, it trains a softmax classifier with expanded face features. The experimental results on ORL, FERET, and LFW face databases demonstrate the effectiveness and robustness of the proposed method for various facial variations.

Cycle-autoencoder based block-sparse joint representation for single sample face recognition

Non-linear dictionary representation of deep features for face recognition from a single sample per person

Surveillance video face recognition with single sample per person based on 3D modeling and blurring

Feature extraction for classification problems and its application to face recognition

In this paper, a face recognition approach based on the hybrid of the approximate neural network with sparse RAM (SN-tuple) and Fisher's linear discriminant (FLD) is presented. Firstly, the data of original face images are imported into the SN-tuple to classify these faces roughly. Then FLD, a classical statistical pattern recognition method, are used to classify these faces precisely. Experimental results demonstrate that this proposed approach achieves better performance than the SN-tuple and FLD for face recognition respectively.