.png){kind=icon}
返回
Supervised sparse representation method with a heuristic strategy and face recognition experiments
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2011.10.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we propose a supervised sparse representation method for face recognition. We assume that the test sample could be approximately represented by a sparse linear combination of all the training samples, where the term sparse means that in the linear combination most training samples have zero coefficients. We exploit a heuristic strategy to achieve this goal. First, we determine a linear combination of all the training samples that best represents the test sample and delete the training sample whose coefficient has the minimum absolute value. Then a similar procedure is carried out for the remaining training samples and this procedure is repeatedly carried out till the predefined termination condition is satisfied. The finally remaining training samples are used to produce a best representation of the test sample and to classify it. The face recognition experiments show that the proposed method can achieve promising classification accuracy. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Face recognition
Pattern recognition
Image representation
Classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Twinning in Hexagonal Close-Packed Materials: The Role of Phase Transformation六方密堆积材料中的孪晶: 相变的作用.png)
Metals
OAAI
MetalsIF0
OAAI分享收藏分享收藏
查看更多内容