文件名称:[7---2002]-Solving-the-small-sample-size-problem-
- 所属分类：
- 图形/文字识别
- 资源属性：
- [PDF]
- 上传时间：
- 2012-11-26
- 文件大小：
- 263kb
- 下载次数：
- 0次
- 提 供 者：
- Hung ******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix S,? in Linear Discriminant Analysis (LDA). Dijjrent methods have been proposed la
solve this problem in face recognition literature. Some methods reduce the dimension of the original sample space and hence unavoidably remove the null space of which has been demonstrated to contain considerable
discriminative information whereas other methods suffer from the computational problem. In this paper, we propose a new method to make use of the null space of s,eflectively and solve the small sample size problem of LDA. We compare our method with several well-known methods. and demonstrate the eficiency of our method-The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix S,? in Linear Discriminant Analysis (LDA). Dijjrent methods have been proposed la
solve this problem in face recognition literature. Some methods reduce the dimension of the original sample space and hence unavoidably remove the null space of which has been demonstrated to contain considerable
discriminative information whereas other methods suffer from the computational problem. In this paper, we propose a new method to make use of the null space of s,eflectively and solve the small sample size problem of LDA. We compare our method with several well-known methods. and demonstrate the eficiency of our method
solve this problem in face recognition literature. Some methods reduce the dimension of the original sample space and hence unavoidably remove the null space of which has been demonstrated to contain considerable
discriminative information whereas other methods suffer from the computational problem. In this paper, we propose a new method to make use of the null space of s,eflectively and solve the small sample size problem of LDA. We compare our method with several well-known methods. and demonstrate the eficiency of our method-The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix S,? in Linear Discriminant Analysis (LDA). Dijjrent methods have been proposed la
solve this problem in face recognition literature. Some methods reduce the dimension of the original sample space and hence unavoidably remove the null space of which has been demonstrated to contain considerable
discriminative information whereas other methods suffer from the computational problem. In this paper, we propose a new method to make use of the null space of s,eflectively and solve the small sample size problem of LDA. We compare our method with several well-known methods. and demonstrate the eficiency of our method
(系统自动生成,下载前可以参看下载内容)
下载文件列表
[7 - 2002] Solving the small sample size problem of LDA.pdf