Abstract
Fast training and testing procedures are crucial in biometrics recognition research. Conventional algorithms, e.g., principal component analysis (PCA), fail to efficiently work on large-scale and high-resolution image data sets. By incorporating merits from both two-dimensional PCA (2DPCA)-based image decomposition and fast numerical calculations based on Haarlike bases, this technical correspondence first proposes binary 2DPCA (B-2DPCA). Empirical studies demonstrated the advantages of B-2DPCA compared with 2DPCA and binary PCA.
| Original language | English |
|---|---|
| Pages (from-to) | 1176-1180 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics |
| Volume | 38 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Aug 2008 |
Keywords
- 2-D PCA (2DPCA)
- Face recognition
- Haarlike bases
- Principal component analysis (PCA)
- Subspace selection