Quaternion-based improved LPP method for color face recognition

In recent years, pattern recognition and computer vision have increasingly become the focus of research. Locality preserving projection (LPP) is a very important learning method in these two fields and has been widely used. Using LPP to perform face recognition, we usually can get a high accuracy. However, the face recognition application of LPP suffers from a number of problems and the small sample size is the most famous one. Moreover, though the face image is usually a color image, LPP cannot sufficiently exploit the color and we should first convert the color image into the gray image and then apply LPP to it. Transforming the color image into the gray image will cause a serious loss of image information. In this paper, we first use the quaternion to represent the color pixel. As a result, an original training or test sample can be denoted as a quaternion vector. Then we apply LPP to the quaternion vectors to perform feature extraction for the original training and test samples. The devised quaternion-based improved LPP method is presented in detail. Experimental results show that our method can get a higher classification accuracy than other methods.     

A hierarchical structure with improved OMP sparse representation used with face recognition

With the rapid development of the face recognition technology, more and more optical products are applied in people's real life. The recognition accuracy can be improved by increasing the number of training samples, but the colossal training samples will result in the increase of computational complexity. In recent years, sparse representation method becomes a research hot spot on face recognition. In this paper we propose an energy constrain orthogonal matching pursuit (ECOMP) algorithm for sparse representation to select the few training samples and a hierarchical structure for face recognition. We filter the training samples with ECOMP algorithm and then we compute the weights by all selected training samples. At last we find the closest recovery sample to the test sample. Simultaneously the experimental results in AR, ORL and FERET database also show that our proposed method has better recognition performance than the LRC and SRC_OMP method.     

Integrating the original face images and “symmetrical faces” to perform face recognition

Using the original and ‘symmetrical face’ training samples to perform representation based face recognition was first proposed in [1]. It simultaneously used the original and ‘symmetrical face’ training samples to perform a two-step classification and achieved an outstanding classification result. However, in [1] the “symmetrical face” is devised only for one method. In this paper, we do some improvements on the basis of [1] and combine this “symmetrical faces” transformation with several representation based methods. We exploit all original training samples, left “symmetrical face” training samples and right “symmetrical face” training samples for classification and use the score fusion for ultimate face recognition. The symmetry of the face is first used to generate new samples, which is different from original face image but can really reflect some possible appearance of the face. It effectively overcomes the problem of non-sufficient training samples. The experimental results show that the proposed scheme can be used to improve a number of traditional representation based methods including those that are not presented in the paper.     

基于WSSRC单样本人脸识别及样本扩充方法研究

由于传统的SRC方法的实时性不强、单样本条件下算法性能低等缺点,提出了融合全局和局部特征的加权超级稀疏表示人脸识别方法(WSSRC),同时采用一种三层级联的虚拟样本产生方法获取冗余样本,将生成的多种表情和多种姿态的新样本当成训练样本,运用WSSRC算法进行人脸识别分类。在单样本的情况下,实验证实在ORL人脸库上该方法比传统的SRC方法提高了15.53%的识别率,使用在FERET 人脸库上则提高7.67%。这样的方法与RSRC 、SSRC、DMMA、DCT-based DMMA、I-DMMA相比,一样具备较好的识别性能。     

A sparse representation method based on kernel and virtual samples for face recognition

To improve the classification accuracy of face recognition, a sparse representation method based on kernel and virtual samples is proposed in this paper. The proposed method has the following basic idea: first, it extends the training samples by copying the left side of the original training samples to the right side to form virtual training samples. Then the virtual training samples and the original training samples make up a new training set and we use a kernel-induced distance to determine M nearest neighbors of the test sample from the new training set. Second, it expresses the test sample as a linear combination of the selected M nearest training samples and finally exploits the determined linear combination to perform classification of the test sample. A large number of face recognition experiments on different face databases illustrate that the error ratios obtained by our method are always lower more or less than face recognition methods including the method mentioned in Xu and Zhu [21], the method proposed in Xu and Zhu [39], sparse representation method based on virtual samples (SRMVS), collaborative representation based classification with regularized least square (CRC_RLS), two-phase test sample sparse representation (TPTSSR), and the feature space-based representation method.     

Face image recognition via collaborative representation on selected training samples

In this paper, we present a collaborative representation-based classification on selected training samples (CRC_STS) for face image recognition. The CRC_STS uses a two stage scheme: The first stage is to select some most significant training samples from the original training set by using a multiple round of refining process. The second stage is to use collaborative representation classifier to perform classification on the selected training samples. Our method can be regarded as a sparse representation approach but without imposing l₁-norm constraint on representation coefficients. The experimental results on three well known face databases show that our method works very well.     

Producing virtual face images for single sample face recognition

For single sample face recognition, there are limited training samples, so the traditional face recognition methods are not applicable to this problem. In this paper we propose to combine two methods to produce virtual face images for single sample face recognition. We firstly use a symmetry transform to produce symmetrical face images. We secondly use the linear combination of two samples to generate virtual samples. As a result, we convert the special single sample problem into a non-single sample problem. We then use the 2DPCA method to extract features from the samples and use the nearest neighbor classifier to perform classification. Experimental results show that the proposed method can effectively improve the recognition rate of single sample face recognition.     

A novel virtual samples-based sparse representation method for face recognition

A limited training set usually limits the performance of face recognition in practice. Even sparse representation-based methods which outperform in face recognition cannot avoid such situation. In order to effectively improve recognition accuracy of sparse representation-based methods on a limited training set, a novel virtual samples-based sparse representation (VSSR) method for face recognition is proposed in this paper. In the proposed method, virtual training samples are constructed to enrich the size and diversity of a training set and a sparse representation-based method is used to classify test samples. Extensive experiments on different face databases confirm that VSSR is robust to illumination variations and works better than many representative representation-based face recognition methods.     

Face recognition based on PCA and logistic regression analysis

Face recognition is an important research hotspot. More and more new methods have been proposed in recent years. In this paper, we propose a novel face recognition method which is based on PCA and logistic regression. PCA is one of the most important methods in pattern recognition. Therefore, in our method, PCA is used to extract feature and reduce the dimensions of process data. Afterwards, we present a novel classification algorithm and use logistic regression as the classifier for face recognition. The experimental results on two different face databases are presented to illustrate the efficacy of our proposed method.     

Optimizing Few-Shot Learning Based on Variational Autoencoders

Despite the importance of few-shot learning, the lack of labeled training data in the real world makes it extremely challenging for existing machine learning methods because this limited dataset does not well represent the data variance. In this research, we suggest employing a generative approach using variational autoencoders (VAEs), which can be used specifically to optimize few-shot learning tasks by generating new samples with more intra-class variations on the Labeled Faces in the Wild (LFW) dataset. The purpose of our research is to increase the size of the training dataset using various methods to improve the accuracy and robustness of the few-shot face recognition. Specifically, we employ the VAE generator to increase the size of the training dataset, including the basic and the novel sets while utilizing transfer learning as the backend. Based on extensive experimental research, we analyze various data augmentation methods to observe how each method affects the accuracy of face recognition. The face generation method based on VAEs with perceptual loss can effectively improve the recognition accuracy rate to 96.47% using both the base and the novel sets.     

A novel pose and illumination robust face recognition with a single training image per person algorithm

In the real-world application of face recognition system, owing to the difficulties of collecting samples or storage space of systems, only one sample image per person is stored in the system, which is so-called one sample per person problem. Moreover, pose and illumination have impact on recognition performance. We propose a novel pose and illumination robust algorithm for face recognition with a single training image per person to solve the above limitations. Experimental results show that the proposed algorithm is an efficient and practical approach for face recognition.     

A palmprint recognition method based on multi-step representation

Sparse representation uses all training samples to represent a test sample only once, which can be regarded as a one step representation. However, in palmprint recognition, the appearances of palms are highly correlated which means the information provided by all the training samples are redundant while using the representation-based methods. Hence, how to obtain suitable samples for representation deserves exploring. In this paper, we devise a multi-step representation manner to extract the most representative samples for representation and recognition. In addition, the proposed sample selection strategy is based on contributions of the classes, not merely the effort of a single sample. Compared with some other appearance-based methods, the proposed method obtained a competitive result on PolyU multispectral palmprint database.     

利用几何特性及神经网络进行人脸探测技术的研究

在人脸识别过程中 ,首先也是最重要的一个环节是人脸探测 ,因为一旦从图像中定位并提取到了人脸 ,那么下一步的人脸识别工作就变得非常容易。眼睛是人脸图像中最容易探测的部位 ,而且通过探测双眼来发现人脸最符合人的视觉习惯。提出了一种基于几何特征分析和人工神经网络的由粗到细的两级人脸探测方法。在第一级中 ,眼睛和脸是通过测量眼睛的尺寸和眼睛与脸的位置关系探测到的 ,第一级的输出是一个尺寸归一化的人脸 ,但偶尔也伴随着一个或多个因对复杂背景中与眼睛类似的物体的误判而得到的非人脸图像 ;第二级神经网络正是用来过滤掉第一级中被误判的人脸。实验表明 ,这种由粗到细的两级人脸探测系统具有很高的稳定性和探测正确率     

A two-phase face recognition method in frequency domain

In this paper, we propose a two-phase face recognition method in frequency domain using discrete cosine transform (DCT) and discrete Fourier transform (DFT). The absolute values of DCT coefficients or DFT amplitude spectra are used to represent the face image, i.e. the transformed image. Then a two-phase face classification method is applied to the transformed images. This method is as follows: its first phase uses the Euclidean distance formula to calculate the distance between a test sample and each sample in the training sets, and then exploits the Euclidean distance of each training sample to determine K nearest neighbors for the test sample. Its second phase represents the test sample as a linear combination of the determined K nearest neighbors and uses the representation result to perform classification. In addition, we use various numbers of DCT coefficients and DFT amplitude spectra to test the effect on our algorithms. The experimental results show that our method outperforms the two-phase face recognition method based on space domain of face images.     

基于子空间分析的人脸识别方法研究

人脸识别技术是模式识别和机器视觉领域的一个重要研究方向,在众多人脸识别的算法中,基于子空间分析的特征提取方法以其稳定可靠的识别效果成为了人脸识别中特征提取的主流方法之一。本文对目前应用较多的子空间分析方法进行了研究,具体介绍了线性子空间分析方法：主成分分析（PCA）、线性鉴别分析（LDA）、独立主成分分析（ICA）、快速主成分分析（FastICA）等及非线性子空间分析方法：基于核的PCA （KPCA）等的基本思想及其在人脸识别中的研究进展,包括一些新的研究成果。此外,还应用orl及Yale B人脸库对几个基础的子空间方法进行了验证实验。实验结果表明,在几个子空间分析方法中,FastICA算法取得了最高的识别率。最后结合实验结果对各算法的优缺点进行了分析总结。     

Face recognition based on PCA image reconstruction and LDA

Face recognition has become a research hotspot in the field of pattern recognition and artificial intelligence. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are two traditional methods in pattern recognition. In this paper, we propose a novel method based on PCA image reconstruction and LDA for face recognition. First, the inner-classes covariance matrix for feature extraction is used as generating matrix and then eigenvectors from each person is obtained, then we obtain the reconstructed images. Moreover, the residual images are computed by subtracting reconstructed images from original face images. Furthermore, the residual images are applied by LDA to obtain the coefficient matrices. Finally, the features are utilized to train and test SVMs for face recognition. The simulation experiments illustrate the effectivity of this method on the ORL face database.     

Robustness quantification method for network intrusion detection models

Deep learning techniques have been successfully applied to network intrusion detection tasks, but as in the case of autonomous driving and face recognition, the reliability of the system itself has become a pressing issue. Robustness is a key attribute to determine whether a deep learning system is secure and reliable, and we also choose to explore the security of intrusion detection models from a new perspective of robustness quantification. In this paper, we focus on the intrusion detection model based on long and short-term memory, and use a fine-grained linear approximation method to derive a more accurate robustness bound on the nonlinear activation function with tighter linear constraints. We can use this bound to quantitatively measure the robustness of the detection model and determine whether the model is susceptible to the influence of adversarial samples. In our experiments, we test networks with various structures on the MNIST dataset, and the results show that our proposed method can effectively deduce the robustness bounds of output elements, and has good scalability and applicability.     

半监督判别分析的跨库语音情感识别

针对训练样本与测试样本来自不同语音情感数据库造成特征向量空间分布不匹配的问题,采用半监督判别分析减小二者的差异。首先寻找有标签的训练样本和来自另一个库的部分无标签训练样本之间的最优投影方向。基于一致性假设即相近的点更有可能具有相同的类别,利用p近邻图对无标签训练样本相近点之间的关系进行建模,从而获得无标签样本的分布信息。在保证无标签样本间流形结构的同时,使所有训练样本类间散度和类内散度的比值达到最大,从而得到最优的投影方向。采用两组实验进行验证,第1组用eNTERFACE库训练去测试Berlin库,识别率为51.41%,第2组用Berlin库训练测试eNTERFACE库,识别率为45.76%,相比未采用半监督判别分析的识别结果分别有了13.72%和22.81%的提高,说明该算法的有效性。通过实验前后数据的可视化分析,说明利用半监督判别分析确实减小了不同库之间特征向量空间分布的不匹配问题,从而提高跨库语音情感识别率。      

用于快速人脸识别的光学协处理器

设计了一种用于快速人脸识别的光学协处理器。提出正负图像组合编码方法，一步实现了通常需要三步的数学形态学击中击不中变换，提高了识别速度。改进传统的识别判据，改善了识别效果。采用一个液晶投影板同时显示待识别图像和参考图像，简化了结构。给出了实验结果。