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

Face recognition with single training sample has the problem that the sample is single and face pattern is changeable. The rate of traditional face recognition methods declines seriously in the case of single training sample. Thus, studying the face recognition method which is appropriate for single training sample is challenging in face recognition field. In this paper, in order to solve the problem of single training sample, sample extension method is adopted to expand fourteen virtual samples. And for the problem of changeable face pattern, like pose, expressions, illumination etc., this paper uses image blocking and applies weighted two-directional 2DPCA to extract the local feature information of face image. Further, fuse the local feature information of sub-image to face recognition. The experimental results on ORL and YALE face database show that the method in this paper achieves good recognition effect.

Similarity mapping for robust face recognition via a single training sample per person

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.

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

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

Due to its wide applications in practice, face recognition has been an active research topic. With the availability of adequate training samples, many machine learning methods could yield high face recognition accuracy. However, under the circumstance of inadequate training samples, especially the extreme case of having only a single training sample, face recognition becomes challenging. How to deal with conflicting concerns of the small sample size and high dimensionality in one-sample face recognition is critical for its achievable recognition accuracy and feasibility in practice. Being different from the conventional methods for global face recognition based on generalization ability promotion and local face recognition depending on image segmentation, a single-sample face recognition algorithm based on locality preserving projection (LPP) feature transfer is proposed here. First, transfer sources are screened to obtain the selective sample source using the whitened cosine similarity metric. Second, we project the vectors of source faces and target faces into feature subspace by LPP, respectively, and calculate the feature transfer matrix to approximate the mapping relationship on source faces and target faces in subspace. Then, the feature transfer matrix is used on training samples to transfer the original macro characteristics to target macro characteristics. Finally, the nearest neighbor classifier is used for face recognition. Our results based on popular databases FERET, ORL, and Yale demonstrate the superiority of the proposed LPP feature transfer-based one-sample face recognition algorithm when compared with popular single-sample face recognition algorithms, such as (PC) $^{2}\text{A}$ and Block FLDA.

Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the database. In this case, many of the popular face recognition methods fail to work well due to the inability to learn the discriminatory information specific to the persons to be identified. To address this problem, in this paper, we propose an Adaptive Generic Learning (AGL) method, which adapts a generic discriminant model to better distinguish the persons with single face sample. As a specific implementation of the AGL, a Coupled Linear Representation (CLR) algorithm is proposed to infer, based on the generic training set, the within-class scatter matrix and the class mean of each person given its single enrolled sample. Thus, the traditional Fisher's Linear Discriminant (FLD) can be applied to SSPP task. Experiments on the FERET and a challenging passport face database show that the proposed method can achieve better results compared with other common solutions to the SSPP problem.

Lack of training samples is the primary cause of low accuracy in the face recognition problem. Especially when only one labeled sample per person is available, many algorithms suffer a slump on performance or even fail to work. In order to increase the accuracy in single training samples recognition problem, virtual samples are generated to enlarge the training set. In this paper, we generate the virtual sample by subtracting the test sample from each training sample and proposed the improved CRC for single training sample face recognition. The experiment results on ORL and FERET face database are provided to validate the effectiveness and robustness of the proposed method.

Rapid growth of social networks has provided an extraordinary medium to share a large volume of photographs online. This calls for designing efficient face recognition techniques that are applicable to images with low resolutions and arbitrary poses. This paper proposes a new pose invariant face recognition method for low resolution images using only a single training sample. A 3D model, reconstructed using Generic Elastic Model (3D GEM) from a frontal view training sample, is used to generate a set of nonfrontal gallery face images. The face region of the nonfrontal query sample is then extracted using the same landmark detection technique as in the 3D GEM algorithm. Afterwards, a novel texture representation technique called Local Comparative Decimal Pattern (LCDP) is proposed to extract features from each of the training and query samples. A set of experimental results on the ORL, Georgia Tech (GT), and LFW face databases demonstrates the efficiency of the proposed method compared to other state-of-the-art approaches.

Biometric features such as fingerprints, iris patterns, and face features help to identify people and restrict access to secure areas by performing advanced pattern analysis and matching. Face recognition is one of the most promising biometric methodologies for human identification in a non-cooperative security environment. However, the recognition results obtained by face recognition systems are a affected by several variations that may happen to the patterns in an unrestricted environment. As a result, several algorithms have been developed for extracting different facial features for face recognition. Due to the various possible challenges of data captured at different lighting conditions, viewing angles, facial expressions, and partial occlusions in natural environmental conditions, automatic facial recognition still remains as a difficult issue that needs to be resolved. In this paper, we propose a novel approach to tackling some of these issues by analyzing the local textural descriptions for facial feature representation. The textural information is extracted by an enhanced local binary pattern (ELBP) description of all the local regions of the face. The relationship of each pixel with respect to its neighborhood is extracted and employed to calculate the new representation. ELBP reconstructs a much better textural feature extraction vector from an original gray level image in different lighting conditions. The dimensionality of the texture image is reduced by principal component analysis performed on each local face region. Each low dimensional vector representing a local region is now weighted based on the significance of the sub-region. The weight of each sub-region is determined by employing the local variance estimate of the respective region, which represents the significance of the region. The final facial textural feature vector is obtained by concatenating the reduced dimensional weight sets of all the modules (sub-regions) of the face image. Experiments conducted on various popular face databases show promising performance of the proposed algorithm in varying lighting, expression, and partial occlusion conditions. Four databases were used for testing the performance of the proposed system: Yale Face database, Extended Yale Face database B, Japanese Female Facial Expression database, and CMU AMP Facial Expression database. The experimental results in all four databases show the effectiveness of the proposed system. Also, the computation cost is lower because of the simplified calculation steps. Research work is progressing to investigate the effectiveness of the proposed face recognition method on pose-varying conditions as well. It is envisaged that a multilane approach of trained frameworks at different pose bins and an appropriate voting strategy would lead to a good recognition rate in such situation.

A face recognition method by using large and representative datasets is presented in this paper. The importance of research on face recognition is fueled by both its scientific challenges and its potential applications. In this contribution, we proposes several approaches to deal with some of the difficulties that one encounters when trying to recognize frontal faces in unconstrained domains and when only one sample per class is available to the learning system. It is possible for an automatic recognition system to compensate for imprecisely localized, partially expression variant faces even when only one single training sample per class is available. Finally, we have shown that the results of an appearance-based approach totally depend on the differences that exist between the facial expressions displayed on the learning and testing images.

In this paper, we propose a novel face recognition method based on local appearance feature extraction using dual-tree complex wavelet transform (DT-CWT). It provides a local multiscale description of images with good directional selectivity and invariance to shifts and in-plane rotations. In the dual-tree implementation, two parallel discrete wavelet transform (DWT) with different lowpass and highpass filters in different scales were used. The linear combination of subbands generated by two parallel DWT is used to generate 6 different directional subbands with complex coefficients. It is insensitive to illumination variations and facial expression changes. 2-D dual-tree complex wavelet transform is less redundant and computationally efficient. The local DT-CWT coefficients are used to extract the facial features which improve the face recognition with small sample size in less computation. The local features based methods have been successfully applied to face recognition and achieved state-of-the-art performance. Normally most of the local appearance based methods the facial features are extracted from several local regions and concatenated into an enhanced feature vector as a face descriptor. In this approach we divide the face into several (m ? m) non-overlapped parallelogram blocks instead of square or rectangle blocks. The local mean, standard deviation and energy of complex wavelet coefficients are used to describe the face image. Experiments, on two well-known databases, namely, Yale and ORL databases, shows the Local DT-CWT approach performs well on illumination, expression and perspective variant faces with single sample compared to PCA and global DT-CWT. Furthermore, in addition to the consistent and promising classification performances, our proposed Local DT-CWT based method has a really low computational complexity.

Local fusion of complex dual-tree wavelet coefficients based face recognition for single sample problem

LocalFace: Learning significant local features for deep face recognition

We proposed a facial motion tracking and expression recognition system based on video data. By a 3D deformable facial model, the online statistical model (OSM) and cylinder head model (CHM) were combined to track 3D facial motion in the framework of particle filtering. For facial expression recognition, a fast and efficient algorithm and a robust and precise algorithm were developed. With the first, facial animation and facial expression were retrieved sequentially. After that facial animation was obtained, facial expression was recognized by static facial expression knowledge learned from anatomical analysis. With the second, facial animation and facial expression were simultaneously retrieved to increase the reliability and robustness with noisy input data. Facial expression was recognized by fusing static and dynamic facial expression knowledge, the latter of which was learned by training a multi-class expressional Markov process using a video database. The experiments showed that facial motion tracking by OSM+CHM is more pose robust than that by OSM, and the facial expression score of the robust and precise algorithm is higher than those of other state-of-the-art facial expression recognition methods.