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

DOI10.1016/j.patcog.2003.02.001zbMath1072.68557OpenAlexW2084313164MaRDI QIDQ1887709

Li Zhao, Wenming Zheng, Cairong Zou

Publication date: 22 November 2004

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2003.02.001

zbMATH Keywords

Linear discriminant analysisFace recognitionNull space

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items (9)

A novel kernel-based maximum a posteriori classification method ⋮ Feature extraction using constrained maximum variance mapping ⋮ A comparison of generalized linear discriminant analysis algorithms ⋮ Locally linear discriminant embedding: An efficient method for face recognition ⋮ Feature extraction using two-dimensional local graph embedding based on maximum margin criterion ⋮ Generalized null space uncorrelated Fisher discriminant analysis for linear dimensionality reduction ⋮ MBLDA: a novel multiple between-class linear discriminant analysis ⋮ Class-Incremental Generalized Discriminant Analysis ⋮ A note on kernel uncorrelated discriminant analysis

Uses Software

• ORL face

Cites Work

• Face recognition based on the uncorrelated discriminant transformation
• A direct LDA algorithm for high-dimensional data -- with application to face recognition

This page was built for publication: An efficient algorithm to solve the small sample size problem for LDA