2013
DOI: 10.1109/tasl.2013.2266774
|View full text |Cite
|
Sign up to set email alerts
|

Non-Negative Temporal Decomposition of Speech Parameters by Multiplicative Update Rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 31 publications
0
9
0
Order By: Relevance
“…(2) is minimized by iteratively updating (3) -(5), which is shown at the top of the next page. These updating rules are derived in [11]. In [11], line spectral pair (LSP) is used as a spectral feature; however, we use a magnitude spectrum to estimate the event basis and activity more precisely.…”
Section: Non-negative Temporal Decompositionmentioning
confidence: 99%
See 3 more Smart Citations
“…(2) is minimized by iteratively updating (3) -(5), which is shown at the top of the next page. These updating rules are derived in [11]. In [11], line spectral pair (LSP) is used as a spectral feature; however, we use a magnitude spectrum to estimate the event basis and activity more precisely.…”
Section: Non-negative Temporal Decompositionmentioning
confidence: 99%
“…These updating rules are derived in [11]. In [11], line spectral pair (LSP) is used as a spectral feature; however, we use a magnitude spectrum to estimate the event basis and activity more precisely. Moreover in [11], each event basis corresponds to a single phoneme.…”
Section: Non-negative Temporal Decompositionmentioning
confidence: 99%
See 2 more Smart Citations
“…Efforts have been put towards learning dynamic models by imposing temporal constraints on the bases as well as on their coefficients. The dynamic models include sparse and dynamic variant of LVM/NMF [8], [9], [10], [11], convolutive NMF [12], [13], [14] and non-negative hidden Markov model (NHMM) [15].…”
Section: Introductionmentioning
confidence: 99%