Abstract
Recursive least squares-based online nonnegative matrix factorization (RLS-ONMF), an NMF algorithm based on the RLS method, was developed to solve the NMF problem online. However, this method suffers from a partial-data problem. In this study, the partial-data problem is resolved by developing an improved online NMF algorithm using RLS and a sparsity constraint. The proposed method, RLS-based online sparse NMF (RLS-OSNMF), consists of two steps; an estimation step that optimizes the Euclidean NMF cost function, and a shaping step that satisfies the sparsity constraint. The proposed algorithm was evaluated with recorded speech and music data and with the RWC music database. The results show that the proposed algorithm performs better than conventional RLS-ONMF, especially during the adaptation process.
| Original language | English |
|---|---|
| Pages (from-to) | 980-985 |
| Number of pages | 6 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E96-A |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2013 |
Keywords
- ALS-NMF
- NMF
- On-line NMF
- RLS
- Sparse NMF
Fingerprint
Dive into the research topics of 'RLS-based on-line sparse nonnegative matrix factorization method for acoustic signal processing systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver