Dimensionality reduction methods play an important role in face recognition. Principal component analysis(PCA) and two-dimensional principal component analysis(2DPCA) are two kinds of important methods in this field. ...Dimensionality reduction methods play an important role in face recognition. Principal component analysis(PCA) and two-dimensional principal component analysis(2DPCA) are two kinds of important methods in this field. Recent research seems like that 2DPCA method is superior to PCA method. To prove if this conclusion is always true, a comprehensive comparison study between PCA and 2DPCA methods was carried out. A novel concept, called column-image difference(CID), was proposed to analyze the difference between PCA and 2DPCA methods in theory. It is found that there exist some restrictive conditions when2 DPCA outperforms PCA. After theoretical analysis, the experiments were conducted on four famous face image databases. The experiment results confirm the validity of theoretical claim.展开更多
Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with ...Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-展开更多
It has been demonstrated that the linear discriminant analysis (LDA) is an effective approach in face recognition tasks. However, due to the high dimensionality of an image space, many LDA based approaches first use t...It has been demonstrated that the linear discriminant analysis (LDA) is an effective approach in face recognition tasks. However, due to the high dimensionality of an image space, many LDA based approaches first use the principal component analysis (PCA) to project an image into a lower dimensional space, then perform the LDA transform to extract discriminant feature. But some useful discriminant information to the following LDA transform will be lost in the PCA step. To overcome these defects, a face recognition method based on the discrete cosine transform (DCT) and the LDA is proposed. First the DCT is used to achieve dimension reduction, then LDA transform is performed on the lower space to extract features. Two face databases are used to test our method and the correct recognition rates of 97.5% and 96.0% are obtained respectively. The performance of the proposed method is compared with that of the PCA+ LDA method and the results show that the method proposed outperforms the PCA+ LDA method.展开更多
The 3D face recognition attracts more and more attention because of its insensitivity to the variance of illumination and pose.There are many crucial problems to be solved in this topic,such as 3D face representation ...The 3D face recognition attracts more and more attention because of its insensitivity to the variance of illumination and pose.There are many crucial problems to be solved in this topic,such as 3D face representation and effective multi-feature fusion.In this paper,a novel 3D face recognition algorithm is proposed and its performance is demonstrated on BJUT-3D face database.This algorithm chooses face surface property and the principle component of relative relation matrix as the face representation features.The similarity metric measure for each feature is defined.A feature fusion strategy is proposed.It is a linear weighted strategy based on Fisher linear discriminant analysis.Finally,the presented algorithm is tested on the BJUT-3D face database.It is concluded that the performance of the algorithm and fusion strategy is satisfying.展开更多
Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and pos...Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).展开更多
Expression, occlusion, and pose variations are three main challenges for 3D face recognition. A novel method is presented to address 3D face recognition using scale-invariant feature transform(SIFT) features on 3D mes...Expression, occlusion, and pose variations are three main challenges for 3D face recognition. A novel method is presented to address 3D face recognition using scale-invariant feature transform(SIFT) features on 3D meshes. After preprocessing, shape index extrema on the 3D facial surface are selected as keypoints in the difference scale space and the unstable keypoints are removed after two screening steps. Then, a local coordinate system for each keypoint is established by principal component analysis(PCA).Next, two local geometric features are extracted around each keypoint through the local coordinate system. Additionally, the features are augmented by the symmetrization according to the approximate left-right symmetry in human face. The proposed method is evaluated on the Bosphorus, BU-3DFE, and Gavab databases, respectively. Good results are achieved on these three datasets. As a result, the proposed method proves robust to facial expression variations, partial external occlusions and large pose changes.展开更多
Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typ...Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typical representative.However,CRC cannot distinguish similar samples well,leading to a wrong classification easily.As an improved method based on CRC,the two-phase test sample sparse representation(TPTSSR)removes the samples that make little contribution to the representation of the testing sample.Nevertheless,only one removal is not sufficient,since some useless samples may still be retained,along with some useful samples maybe being removed randomly.In this work,a novel classifier,called discriminative sparse parameter(DSP)classifier with iterative removal,is proposed for face recognition.The proposed DSP classifier utilizes sparse parameter to measure the representation ability of training samples straight-forward.Moreover,to avoid some useful samples being removed randomly with only one removal,DSP classifier removes most uncorrelated samples gradually with iterations.Extensive experiments on different typical poses,expressions and noisy face datasets are conducted to assess the performance of the proposed DSP classifier.The experimental results demonstrate that DSP classifier achieves a better recognition rate than the well-known SRC,CRC,RRC,RCR,SRMVS,RFSR and TPTSSR classifiers for face recognition in various situations.展开更多
Differences in illumination of the same face can defeat simple face recognition systems,yet most methods that compensate are too difficult to implement. Local quotient image (LQI) is an efficient illumination preproce...Differences in illumination of the same face can defeat simple face recognition systems,yet most methods that compensate are too difficult to implement. Local quotient image (LQI) is an efficient illumination preprocessing method for face recognition systems. An illumination model and a face model were developed,and their use in the new method was analyzed. Analysis of the method's computational complexity showed it to be efficient. Experimental results on Yale Face Database B showed that the method can effectively eliminate the effects of differences in illumination and provides considerable improvement in recognition rates.展开更多
基金Projects(50275150,61173052)supported by the National Natural Science Foundation of China
文摘Dimensionality reduction methods play an important role in face recognition. Principal component analysis(PCA) and two-dimensional principal component analysis(2DPCA) are two kinds of important methods in this field. Recent research seems like that 2DPCA method is superior to PCA method. To prove if this conclusion is always true, a comprehensive comparison study between PCA and 2DPCA methods was carried out. A novel concept, called column-image difference(CID), was proposed to analyze the difference between PCA and 2DPCA methods in theory. It is found that there exist some restrictive conditions when2 DPCA outperforms PCA. After theoretical analysis, the experiments were conducted on four famous face image databases. The experiment results confirm the validity of theoretical claim.
基金This project was supported by Shanghai Shu Guang Project.
文摘Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-
文摘It has been demonstrated that the linear discriminant analysis (LDA) is an effective approach in face recognition tasks. However, due to the high dimensionality of an image space, many LDA based approaches first use the principal component analysis (PCA) to project an image into a lower dimensional space, then perform the LDA transform to extract discriminant feature. But some useful discriminant information to the following LDA transform will be lost in the PCA step. To overcome these defects, a face recognition method based on the discrete cosine transform (DCT) and the LDA is proposed. First the DCT is used to achieve dimension reduction, then LDA transform is performed on the lower space to extract features. Two face databases are used to test our method and the correct recognition rates of 97.5% and 96.0% are obtained respectively. The performance of the proposed method is compared with that of the PCA+ LDA method and the results show that the method proposed outperforms the PCA+ LDA method.
基金Supported by National Natural Science Foundation of China(60533030)Beijing Natural Science Foundation(4061001)
文摘The 3D face recognition attracts more and more attention because of its insensitivity to the variance of illumination and pose.There are many crucial problems to be solved in this topic,such as 3D face representation and effective multi-feature fusion.In this paper,a novel 3D face recognition algorithm is proposed and its performance is demonstrated on BJUT-3D face database.This algorithm chooses face surface property and the principle component of relative relation matrix as the face representation features.The similarity metric measure for each feature is defined.A feature fusion strategy is proposed.It is a linear weighted strategy based on Fisher linear discriminant analysis.Finally,the presented algorithm is tested on the BJUT-3D face database.It is concluded that the performance of the algorithm and fusion strategy is satisfying.
基金supported by the National Natural Science Foundation of China(6137901061772421)
文摘Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).
基金Project(XDA06020300)supported by the"Strategic Priority Research Program"of the Chinese Academy of SciencesProject(12511501700)supported by the Research on the Key Technology of Internet of Things for Urban Community Safety Based on Video Sensor networks
文摘Expression, occlusion, and pose variations are three main challenges for 3D face recognition. A novel method is presented to address 3D face recognition using scale-invariant feature transform(SIFT) features on 3D meshes. After preprocessing, shape index extrema on the 3D facial surface are selected as keypoints in the difference scale space and the unstable keypoints are removed after two screening steps. Then, a local coordinate system for each keypoint is established by principal component analysis(PCA).Next, two local geometric features are extracted around each keypoint through the local coordinate system. Additionally, the features are augmented by the symmetrization according to the approximate left-right symmetry in human face. The proposed method is evaluated on the Bosphorus, BU-3DFE, and Gavab databases, respectively. Good results are achieved on these three datasets. As a result, the proposed method proves robust to facial expression variations, partial external occlusions and large pose changes.
基金Project(2019JJ40047)supported by the Hunan Provincial Natural Science Foundation of ChinaProject(kq2014057)supported by the Changsha Municipal Natural Science Foundation,China。
文摘Face recognition has been widely used and developed rapidly in recent years.The methods based on sparse representation have made great breakthroughs,and collaborative representation-based classification(CRC)is the typical representative.However,CRC cannot distinguish similar samples well,leading to a wrong classification easily.As an improved method based on CRC,the two-phase test sample sparse representation(TPTSSR)removes the samples that make little contribution to the representation of the testing sample.Nevertheless,only one removal is not sufficient,since some useless samples may still be retained,along with some useful samples maybe being removed randomly.In this work,a novel classifier,called discriminative sparse parameter(DSP)classifier with iterative removal,is proposed for face recognition.The proposed DSP classifier utilizes sparse parameter to measure the representation ability of training samples straight-forward.Moreover,to avoid some useful samples being removed randomly with only one removal,DSP classifier removes most uncorrelated samples gradually with iterations.Extensive experiments on different typical poses,expressions and noisy face datasets are conducted to assess the performance of the proposed DSP classifier.The experimental results demonstrate that DSP classifier achieves a better recognition rate than the well-known SRC,CRC,RRC,RCR,SRMVS,RFSR and TPTSSR classifiers for face recognition in various situations.
文摘Differences in illumination of the same face can defeat simple face recognition systems,yet most methods that compensate are too difficult to implement. Local quotient image (LQI) is an efficient illumination preprocessing method for face recognition systems. An illumination model and a face model were developed,and their use in the new method was analyzed. Analysis of the method's computational complexity showed it to be efficient. Experimental results on Yale Face Database B showed that the method can effectively eliminate the effects of differences in illumination and provides considerable improvement in recognition rates.
