On the computational complexity of the empirical mode decomposition algorithm

It has been claimed that the empirical mode decomposition (EMD) and its improved version the ensemble EMD (EEMD) are computation intensive. In this study we will prove that the time complexity of the EMD/EEMD, which has never been analyzed before, is actually equivalent to that of the Fourier Transf...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Physica A Ročník 400; s. 159 - 167
Hlavní autori:	Wang, Yung-Hung, Yeh, Chien-Hung, Young, Hsu-Wen Vincent, Hu, Kun, Lo, Men-Tzung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.04.2014
Predmet:	Complexity Computation Computational efficiency Decomposition EEMD EMD Empirical analysis Equivalence Fourier transforms Space Statistical mechanics Time DIV COMP Space ADD IMFs BFV MUL EEMD Time MEMD EMD Complexity
ISSN:	0378-4371, 1873-2119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!