Binary sparse nonnegative matrix factorization
- Publication Type:
- Journal Article
- IEEE Transactions on Circuits and Systems for Video Technology, 2009, 19 (5), pp. 772 - 777
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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. © 2009 IEEE.
Please use this identifier to cite or link to this item: