An efficient algorithm to solve the small sample size problem for LDA

Wenming Zheng

doi:10.1016/j.patcog.2003.02.001

Return

An efficient algorithm to solve the small sample size problem for LDA

2004-05-01

PRE

Wenming Zheng *

Li Zhao

DOI：10.1016/j.patcog.2003.02.001

Original

Original request for help

Save

Abstract

En 中文

In this paper, we present an efficient algorithm to solve the most discriminant vectors of LDA for high-dimensional data set. The experiments on ORL face database confirm the effectiveness of the proposed method. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keywords:

linear discriminant analysis

null space

face recognition

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.