首页> 外文会议>International Conference on Security, Pattern Analysis, and Cybernetics >Adjacent graph-based block kernel nonnegative matrix factorization
【24h】

Adjacent graph-based block kernel nonnegative matrix factorization

机译:基于图形的块内核非负矩阵分解

获取原文

摘要

Using block technique and graph theory, we present a variant of nonnegative matrix factorization (NMF) with high performance for face recognition. We establish a novel objective function in kernel space by the class label information and local scatter information. The class label information is implied in the block decomposition technique and intra-class covariance matrix, while the local scatter information is determined by the adjacent graph matrix. We theoretically construct an auxiliary function related to the objective function and then derive the iterative formulae of our method by solving the stable point of the auxiliary function. The property of auxiliary function shows that our algorithm is convergent. Finally, empirical results show that our method is effective.
机译:使用块技术和图形理论,我们介绍了一种具有高性能的非负矩阵分解(NMF)的变体来面对识别。我们通过类标签信息和本地分散信息在内核空间中建立一个新颖的客观函数。在块分解技术和类别协方差矩阵中暗示类标签信息,而局部散点信息由相邻的图形矩阵确定。理论上,构建与目标函数相关的辅助功能,然后通过解决辅助功能的稳定点来导出我们方法的迭代公式。辅助功能的属性表明,我们的算法是收敛的。最后,经验结果表明,我们的方法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号