Incremental PCA-LDA algorithm

26Citations
Citations of this article
55Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a recursive algorithm of calculating the discriminant features of the PCA-LDA procedure is introduced. This algorithm computes the principal components of a sequence of vectors incrementally without estimating the covariance matrix (so covariance-free) and at the same time computing the linear discriminant directions along which the classes are well separated. Two major techniques are used sequentially in a real time fashion in order to obtain the most efficient and linearly discriminative components. This procedure is done by merging the runs of two algorithms based on principal component analysis (PCA) and linear discriminant analysis (LDA) running sequentially. This algorithm is applied to face recognition problem. Simulation results on different databases showed high average success rate of this algorithm compared to PCA and LDA algorithms. The advantage of the incremental property of this algorithm compared to the batch PCA-LDA is also shown. © 2010 IEEE.

Cite

CITATION STYLE

APA

Dagher, I. (2010). Incremental PCA-LDA algorithm. In CIMSA 2010 - IEEE International Conference on Computational Intelligence for Measurement Systems and Applications, Proceedings (pp. 97–101). https://doi.org/10.1109/CIMSA.2010.5611752

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free