Abstract
This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.
Original language | English |
---|---|
Article number | 4801604 |
Pages (from-to) | 772-777 |
Number of pages | 6 |
Journal | IEEE Transactions on Circuits and Systems For Video Technology |
Volume | 19 |
Issue number | 5 |
DOIs | |
Publication status | Published - May 2009 |
Keywords
- binary principal component analysis
- binary sparse nonnegative matrix factorization
- face images
- fast part-based subspace selection algorithm
- image occlusions