Improved CRC for Single Training Sample on Face Recognition

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.

Lack of training samples always affects the performance and robustness of face recognition. Generating virtual samples is one of effective methods to expand the training set. When the virtual samples are able to simulate the variations of facial images including variations of illuminations, facial postures and the facial expressions, the robustness will be enhanced and the accuracy will be improved obviously in the face recognition problem. In this paper, an improved linear representation-based classification combined virtual samples (ILRCVS) is proposed. First, we design a new objective function that simultaneously considers the information of the virtual training samples and the virtual test sample. Second, an alternating minimization algorithm is proposed to solve the optimization problem of the objective function. Finally, a new classification criterion combined with the virtual training and test sample is proposed. Experimental results on the Georgia Tech, FERET and Yale B face databases show that the proposed method is more robust than three state-of-the-art face recognition methods, LRC, SRC and CRC.

Cycle-autoencoder based block-sparse joint representation for single sample 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.

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.

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

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.

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

Illumination robust single sample face recognition using multi-directional orthogonal gradient phase faces

Single-sample face recognition is one of the most challenging problems in face recognition. We propose a novel algorithm to address this problem based on a sparse representation based classification (SRC) framework. The new algorithm is robust to image misalignment and pixel corruption, and is able to reduce required gallery images to one sample per class. To compensate for the missing illumination information traditionally provided by multiple gallery images, a sparse illumination learning and transfer (SILT) technique is introduced. The illumination in SILT is learned by fitting illumination examples of auxiliary face images from one or more additional subjects with a sparsely-used illumination dictionary. By enforcing a sparse representation of the query image in the illumination dictionary, the SILT can effectively recover and transfer the illumination and pose information from the alignment stage to the recognition stage. Our extensive experiments have demonstrated that the new algorithms significantly outperform the state of the art in the single-sample regime and with less restrictions. In particular, the single-sample face alignment accuracy is comparable to that of the well-known Deformable SRC algorithm using multiple gallery images per class. Furthermore, the face recognition accuracy exceeds those of the SRC and Extended SRC algorithms using hand labeled alignment initialization.

A single gallery-based face recognition using extended joint sparse representation

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.

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

Small sample size is one of the most challenging problems in face recognition due to the difficulty of sample collection in many real-world applications. By representing the query sample as a linear combination of training samples from all classes, the so-called collaborative representation based classification (CRC) shows very effective face recognition performance with low computational cost. However, the recognition rate of CRC will drop dramatically when the available training samples per subject are very limited. One intuitive solution to this problem is operating CRC on patches and combining the recognition outputs of all patches. Nonetheless, the setting of patch size is a non-trivial task. Considering the fact that patches on different scales can have complementary information for classification, we propose a multi-scale patch based CRC method, while the ensemble of multi-scale outputs is achieved by regularized margin distribution optimization. Our extensive experiments validated that the proposed method outperforms many state-of-the-art patch based face recognition algorithms.

We propose a fast kernel sparse representation based classification (SRC) for undersampling problem, i.e., each class has very few training samples, in face recognition. The proposed algorithm exploits a nonlinear mapping to map the data from the original input space into a high-dimensional feature space. Then, it performs very fast sparse representation and classification of samples in this space. Similar to the typical SRC methods, the proposed approach is based on the L1 norm minimization, whose direct solution can be very time-consuming. In order to improve the computational efficiency, our method uses the coordinate descent method in the feature space, which can avoid directly solving the L1 norm minimization problem, and significantly expedites the computational procedure. Compared with other SRC methods based on the L1 norm minimization, our proposed method achieves very high computational efficiency, without significantly degrading the classification performance. Several experiments on popular face databases demonstrate that our method is a promising efficient kernel SRC based method.