To improve the classification performance of the kernel minimum squared error（ KMSE）, an enhanced KMSE algorithm（ EKMSE） is proposed. It redefines the regular objective function by introducing a novel class label ...To improve the classification performance of the kernel minimum squared error（ KMSE）, an enhanced KMSE algorithm（ EKMSE） is proposed. It redefines the regular objective function by introducing a novel class label definition, and the relative class label matrix can be adaptively adjusted to the kernel matrix.Compared with the common methods, the newobjective function can enlarge the distance between different classes, which therefore yields better recognition rates. In addition, an iteration parameter searching technique is adopted to improve the computational efficiency. The extensive experiments on FERET and GT face databases illustrate the feasibility and efficiency of the proposed EKMSE. It outperforms the original MSE, KMSE,some KMSE improvement methods, and even the sparse representation-based techniques in face recognition, such as collaborate representation classification（ CRC）.展开更多
Bagging is not quite suitable for stable classifiers such as nearest neighbor classifiers due to the lack of diversity and it is difficult to be directly applied to face recognition as well due to the small sample si...Bagging is not quite suitable for stable classifiers such as nearest neighbor classifiers due to the lack of diversity and it is difficult to be directly applied to face recognition as well due to the small sample size （SSS） property of face recognition. To solve the two problems,local Bagging （L-Bagging） is proposed to simultaneously make Bagging apply to both nearest neighbor classifiers and face recognition. The major difference between L-Bagging and Bagging is that L-Bagging performs the bootstrap sampling on each local region partitioned from the original face image rather than the whole face image. Since the dimensionality of local region is usually far less than the number of samples and the component classifiers are constructed just in different local regions,L-Bagging deals with SSS problem and generates more diverse component classifiers. Experimental results on four standard face image databases （AR,Yale,ORL and Yale B） indicate that the proposed L-Bagging method is effective and robust to illumination,occlusion and slight pose variation.展开更多
A method combining eigenface with different wavelet subbands for face recognition is proposed.Each training image is decomposed into multi-subbands for extracting their eigenvector sets and projection vectors.In the r...A method combining eigenface with different wavelet subbands for face recognition is proposed.Each training image is decomposed into multi-subbands for extracting their eigenvector sets and projection vectors.In the recognition process,the inner product distance between the projection vectors of the test image and that of the training image are calculated.The training image,corresponding to the maximum distance under the given threshold condition,is considered as the final result.The experimental results on the ORL and YALE face database show that,compared with the eigenface method directly on the image domain or on a single wavelet subband,the recognition accuracy using the proposed method is improved by 5% without influencing the recognition speed.展开更多
Linear Discriminant Analysis （LDA） is one of the principal techniques used in face recognition systems. LDA is well-known scheme for feature extraction and dimension reduction. It provides improved performance over ...Linear Discriminant Analysis （LDA） is one of the principal techniques used in face recognition systems. LDA is well-known scheme for feature extraction and dimension reduction. It provides improved performance over the standard Principal Component Analysis （PCA） method of face recognition by introducing the concept of classes and distance between classes. This paper provides an overview of PCA, the various variants of LDA and their basic drawbacks. The paper also has proposed a development over classical LDA, i.e., LDA using wavelets transform approach that enhances performance as regards accuracy and time complexity. Experiments on ORL face database clearly demonstrate this and the graphical comparison of the algorithms clearly showcases the improved recognition rate in case of the proposed algorithm.展开更多
基金The Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)the National Natural Science Foundation of China(No.61572258,61103141,51405241)+1 种基金the Natural Science Foundation of Jiangsu Province(No.BK20151530)Overseas Training Programs for Outstanding Young Scholars of Universities in Jiangsu Province
文摘To improve the classification performance of the kernel minimum squared error（ KMSE）, an enhanced KMSE algorithm（ EKMSE） is proposed. It redefines the regular objective function by introducing a novel class label definition, and the relative class label matrix can be adaptively adjusted to the kernel matrix.Compared with the common methods, the newobjective function can enlarge the distance between different classes, which therefore yields better recognition rates. In addition, an iteration parameter searching technique is adopted to improve the computational efficiency. The extensive experiments on FERET and GT face databases illustrate the feasibility and efficiency of the proposed EKMSE. It outperforms the original MSE, KMSE,some KMSE improvement methods, and even the sparse representation-based techniques in face recognition, such as collaborate representation classification（ CRC）.
文摘Bagging is not quite suitable for stable classifiers such as nearest neighbor classifiers due to the lack of diversity and it is difficult to be directly applied to face recognition as well due to the small sample size （SSS） property of face recognition. To solve the two problems,local Bagging （L-Bagging） is proposed to simultaneously make Bagging apply to both nearest neighbor classifiers and face recognition. The major difference between L-Bagging and Bagging is that L-Bagging performs the bootstrap sampling on each local region partitioned from the original face image rather than the whole face image. Since the dimensionality of local region is usually far less than the number of samples and the component classifiers are constructed just in different local regions,L-Bagging deals with SSS problem and generates more diverse component classifiers. Experimental results on four standard face image databases （AR,Yale,ORL and Yale B） indicate that the proposed L-Bagging method is effective and robust to illumination,occlusion and slight pose variation.
基金Supported by Shanghai Science and Technology DevelopmentFoundation (04D02-1)
文摘A method combining eigenface with different wavelet subbands for face recognition is proposed.Each training image is decomposed into multi-subbands for extracting their eigenvector sets and projection vectors.In the recognition process,the inner product distance between the projection vectors of the test image and that of the training image are calculated.The training image,corresponding to the maximum distance under the given threshold condition,is considered as the final result.The experimental results on the ORL and YALE face database show that,compared with the eigenface method directly on the image domain or on a single wavelet subband,the recognition accuracy using the proposed method is improved by 5% without influencing the recognition speed.
文摘Linear Discriminant Analysis （LDA） is one of the principal techniques used in face recognition systems. LDA is well-known scheme for feature extraction and dimension reduction. It provides improved performance over the standard Principal Component Analysis （PCA） method of face recognition by introducing the concept of classes and distance between classes. This paper provides an overview of PCA, the various variants of LDA and their basic drawbacks. The paper also has proposed a development over classical LDA, i.e., LDA using wavelets transform approach that enhances performance as regards accuracy and time complexity. Experiments on ORL face database clearly demonstrate this and the graphical comparison of the algorithms clearly showcases the improved recognition rate in case of the proposed algorithm.
