Binary Sparse Nonnegative Matrix Factorization

IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:
Journal Article
IEEE Transactions On Circuits And Systems For Video Technology, 2009, 19 (5), pp. 772 - 777
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011000235OK.pdf308.6 kB
Adobe PDF
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 a
Please use this identifier to cite or link to this item: