期刊文献+

Adaptive Face Recognition via Structed Representation

Adaptive Face Recognition via Structed Representation
下载PDF
导出
摘要 In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this condition is not satisfied, we exploit Nearest Subspaee approach to classify the test sample. In order to adapt all the eases, we combine the two approaches to an adaptive classification method-Adaptive approach. The adaptive approach yields greater recognition accuracy than the SRC approach and CRC_RLS approach with low ~ample rate on the Extend Yale B dataset. And it is more efficient than other two approaches. In this paper, we propose a face recognition approach-Structed Sparse Representation-based classification when the measurement of the test sample is less than the number training samples of each subject. When this condition is not satisfied, we exploit Nearest Subspaee approach to classify the test sample. In order to adapt all the eases, we combine the two approaches to an adaptive classification method-Adaptive approach. The adaptive approach yields greater recognition accuracy than the SRC approach and CRC_RLS approach with low ~ample rate on the Extend Yale B dataset. And it is more efficient than other two approaches.
出处 《Computer Aided Drafting,Design and Manufacturing》 2014年第3期6-12,共7页 计算机辅助绘图设计与制造(英文版)
基金 Supported by National Natural Science Foundation of China(No.61170324 and No.61100105)
关键词 face recognition stmcted representation sparse representation adaptive method orthogonal matching pursuit face recognition stmcted representation sparse representation adaptive method orthogonal matching pursuit
  • 相关文献

参考文献19

  • 1Turk M A, Pentland A P. Face recogmnon using eigenfaces [C]/ / Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Maui, Hawaii, USA,1991: 586-591.
  • 2Murase H, Nayar S K. Visual learning and recognition of 3-d objects from appearance [J]. International Journal of Computer Vision, 1995, 14(1): 5-24.
  • 3Tibshirani R. Regression shrinkage and selection via the lasso [J]. Journal of the Royal Statistical SOciety. Series B (Methodological), 1996,58(1): 267-288.
  • 4Donoho D L. For most large underdetermined systems of linear equations the minimal II-norm solution is also the sparsest solution [J]. Communications on Pure and Applied Mathematics, 2006, 59(6): 797-829.
  • 5Tropp J A, Wright S J. Computational methods for sparse solution of linear inverse problems [C]// Proceedings of the IEEE, 2010, 98(6): 948-958.
  • 6Wright J, Yang A Y, Ganesh A, et al. Robust face recognition via sparse representation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(2): 210-227.
  • 7Yang A Y, Wright J, Ma Y, et al. Feature selection in face recognition: A sparse representation perspective [J]. submitted to IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007.
  • 8Shi Q, Li H, Shen C. Rapid face recognition using hashing [C]// 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2010: 2753-2760.
  • 9Zhang L, Yang M, Feng X. Sparse representation or collaborative representation: Which helps face recognition? [C]// 2011 IEEE International Conference on Computer Vision (ICCV), 2011: 471-478.
  • 10Lee K C, Ho J, Kriegman D 1. Acquiring linear subspaces for face recognition under variable lighting [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(5): 684-698.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部