Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (3): 202-204.

• 图形、图像、模式识别 • Previous Articles     Next Articles

Study on face recognition based on Bhattacharyya distance and PCA method

XIONG Jianbin, WANG Qinruo, DENG Jiuying, LIU Qi, YE Baoyu   

  1. Guangdong University of Technology, Guangzhou 510006, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2012-01-21 Published:2012-01-21


熊建斌,王钦若,邓九英,刘 奇,叶宝玉   

  1. 广东工业大学,广州 510006

Abstract: This paper studies the face recognition based on the methods of Bhattacharyya distance and principal component analysis, and proposes a smart feature selection method which combines principal component analysis and Bhattacharyya distance. When the feature vector dimension is high, the sample dimension is reduced by using K-L decomposition. It gets the smallest error rate upper bound by using iterative algorithm which has Bhattacharyya distance feature. The experiments in ORL face database shows that its performance is better than using the methods of LDA, HPCA and HLDA. This algorithm can raise the recognition rate effectively and reduce the time which is used to calculate the Bhattacharyya distance. It has strong practicability.

Key words: Bhattacharyya distance, Principal Component Analysis(PCA), face recognition, PCA+K-L(Principal Component Analysis and Karhunen-Loeve)

摘要: 利用巴氏距离(Bhattacharyya Distance)和PCA(Principal Component Analysis)相结合进行人脸识别研究,提出了使用巴氏距离和PCA相合的算法对特征进行提取。当特征向量维数高时,首先对样本K-L(Karhunen-Loeve)变换进行降维,然后采用巴氏距离特征的迭代算法,得到最小错误率上界。基于ORL人脸数据库的实验表明该方法的识别性能优于LDA、HPCA、HLDA,采用文中的算法可以有效地提高识别率,减少巴氏距离特征计算时间,具有较强的实用性。

关键词: 巴氏距离, 主分量分析, 人脸识别, PCA和K-L变换相结合(PCA+K-L)