.png){kind=icon}
返回
An efficient kernel discriminant analysis method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2005.02.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Small sample size and high computational complexity are two major problems encountered when traditional kernel discriminant analysis methods are applied to high-dimensional pattern classification tasks such as face recognition. In this paper, we introduce a new kernel discriminant learning method, which is able to effectively address the two problems by using regularization and subspace decomposition techniques. Experiments performed on real face databases indicate that the proposed method outperforms, in terms of classification accuracy, existing kernel methods, such as kernel principal component analysis and kernel linear discriminant analysis, at a significantly reduced computational cost. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
kernel machine
small sample size
regularization
face recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Evaluation of charge transfer resistance by geometrical extrapolation of the centre of semicircular impedance diagrams通过半圆阻抗图中心的几何外推法评估电荷转移电阻
PREAI
分享收藏A new LDA-based face recognition system which can solve the small sample size problem.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏