Sparsity promoted non-negative matrix factorization for source separation and detection
Yanlin Wang, Yun Li, K. C. Ho, Alina Zare, M. Skubic
Abstract
Yanlin Wang, Yun Li, K. C. Ho, Alina Zare, M. Skubic
Abstract
The effectiveness of non-negative matrix factorization (NMF) depends on a suitable choice of the number of bases, which is often difficult to decide in practice. This paper imposes sparseness on the factorization coefficients in order to determine the number of bases automatically during the decomposition process. The benefit of sparse promotion for NMF is demonstrated through application to sound source separation as well as acoustic-based human fall detection under strong interference.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The effectiveness of non-negative matrix factorization (NMF) depends on a suitable choice of the number of bases, which is often difficult to decide in practice. This paper imposes sparseness on the factorization coefficients in order to determine the number of bases automatically during the decomposition process. The benefit of sparse promotion for NMF is demonstrated through application to sound source separation as well as acoustic-based human fall detection under strong interference.
Key concepts: Non-negative matrix factorization, Matrix decomposition, Source separation, Computer science, Factorization, Interference (communication), Decomposition, Blind signal separation