Fast Linear Discriminant Analysis Using Binary Bases

9 years 15 days ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data features can be modelled with maximal discriminative power. The main computation in LDA is the dot product between LDA base vector and the data point which involves costly element-wise floating point multiplications. In this paper, we present a fast linear discriminant analysis method called binary LDA (B-LDA), which possesses the desirable property that the subspace projection operation can be computed very efficiently. We investigate the LDA guided non-orthogonal binary subspace method to find the binary LDA bases, each of which is a linear combination of a small number of Haar-like box functions. We also show that B-LDA base vectors are nearly orthogonal to each other. As a result, in the non-orthogonal vector decomposition process, the computationally intensive pseudo-inverse projection operator can be ...
Feng Tang, Hai Tao
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICPR
Authors Feng Tang, Hai Tao
Comments (0)