Abstract
Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to two-dimensional LDA (2DLDA), which is an iterative algorithm for data in matrix representation. In this paper, we propose non-iterative algorithms for 2DLDA. Experimental results show that the non-iterative algorithms achieve competitive recognition rates with the iterative 2DLDA, while they are computationally more efficient than the iterative 2DLDA.
Original language | English |
---|---|
Title of host publication | Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006 |
Pages | 540-543 |
Number of pages | 4 |
Volume | 2 |
DOIs | |
Publication status | Published - 2006 |
Event | 18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, China Duration: Aug 20 2006 → Aug 24 2006 |
Other
Other | 18th International Conference on Pattern Recognition, ICPR 2006 |
---|---|
Country/Territory | China |
City | Hong Kong |
Period | 8/20/06 → 8/24/06 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Computer Vision and Pattern Recognition
- Hardware and Architecture