Yuan, Y. and Li, Xuelong and Pang, Y. and Lu, X. and Tao, D. (2009) Binary sparse nonnegative matrix factorization. Transactions on Circuits and Systems for Video Technology 19 (5), pp. 772-777. ISSN 1051-8215.
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 11 Jul 2013 10:51 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7641 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
