基于KL距离的KPCA人脸识别算法  

KPCA face recognition based on KL divergence

作　　者：王春芳[1] 高煜妤[1] 

机构地区：[1]燕山大学里仁学院实验中心,河北秦皇岛066004

出　　处：《计算机工程与应用》2016年第9期130-134,共5页Computer Engineering and Applications

基　　金：国家自然科学基金面上项目(No.61473339);秦皇岛市科学技术与研究发展计划(No.2012021A057)

摘　　要：针对核主成分分析(KPCA)人脸识别算法中对全局特征变化敏感和忽略局部特征的问题,研究了一种基于KL距离的KPCA人脸识别算法。利用KL距离定义了类间距离和类内差异,设定了一个非线性优化函数来最大化类间距离,同时最小化类内差异,使提取的特征更为紧凑可分,并将其应用于KPCA算法中,利用ORL人脸图像库对算法的性能进行了测试。实验结果表明,该算法相对于传统KPCA算法具有更好的识别效果和稳定性。In order to solve the problem that Kernel Principal Component Analysis face recognition algorithm is sensitive to the change of the overall features, a KPCA face recognition algorithm based on KL divergence is proposed. Using KL distance between-classes distance and within-class dissimilarities are defined. A nonlinear optimization function is established, through that between-classes distance can be maximized, while within-class dissimilarities are minimized, and extracted features are more compact and separable, which is applied to KPCA algorithm. Finally via using ORL face image database the performance of the algorithm is tested. The experimental results show that the algorithm compared with traditional KPCA algorithm has better recognition effect and stability.

关 键 词：核主成分分析 KL距离 类间距离 类内差异 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]