Nonnegative Matrix and Tensor Factorizations 2009
DOI: 10.1002/9780470747278.ch3
|View full text |Cite
|
Sign up to set email alerts
|

Multiplicative Iterative Algorithms for NMF with Sparsity Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…In our test scenarios, the regularization did result in some slight degradation in separation, suggesting that the tonal assumption is not strictly valid-which is not surprising in real-life composed signals. Nevertheless, 1 penalty parameters are ubiquitous in regular NMF algorithms [26,27], so that the added model flexibility is welcome.…”
Section: Sdr Sirmentioning
confidence: 99%
“…In our test scenarios, the regularization did result in some slight degradation in separation, suggesting that the tonal assumption is not strictly valid-which is not surprising in real-life composed signals. Nevertheless, 1 penalty parameters are ubiquitous in regular NMF algorithms [26,27], so that the added model flexibility is welcome.…”
Section: Sdr Sirmentioning
confidence: 99%