首页> 外文会议>2011 International Conference on Computational and Information Sciences >An Efficient Method to Solve Small Sample Size Problem of LDA Using Householder QR Factorization for Face Recognition
【24h】

An Efficient Method to Solve Small Sample Size Problem of LDA Using Householder QR Factorization for Face Recognition

机译:基于Householder QR分解的人脸识别解决LDA小样本问题的有效方法

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we propose an efficient method to solve small sample size problem of linear discriminant analysis (LDA) for face recognition by performing Householder QR factorization procedure only once in the difference space. The proposed method is equivalent to existing LDA methods since all methods search optimal discriminative vectors of LDA in range space of total scatter matrix St and null space of within-class scatter matrix Sw. Since in the proposed method, the discriminant vectors are immediately obtained by performing Householder QR factorization once, the efficiency is improved compared with the existing methods. The effectiveness of the proposed method is verified in the experiments on the standard face databases.
机译:在本文中,我们提出了一种有效的方法,通过在差异空间中仅执行一次Householder QR分解程序来解决线性判别分析(LDA)用于人脸识别的小样本问题。由于所有方法都在总散射矩阵St的范围空间和类内散射矩阵Sw的零空间中搜索LDA的最优判别向量,因此该方法等效于现有的LDA方法。由于在所提出的方法中,通过一次执行Householder QR分解就可以立即获得判别向量,因此与现有方法相比,效率得到了提高。在标准人脸数据库的实验中验证了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号