On the computational complexity of the empirical mode decomposition algorithm

Yung Hung Wang; Chien Hung Yeh; Hsu Wen Vincent Young; Kun Hu; Men Tzung Lo

doi:10.1016/j.physa.2014.01.020

On the computational complexity of the empirical mode decomposition algorithm

Yung Hung Wang, Chien Hung Yeh, Hsu Wen Vincent Young, Kun Hu, Men Tzung Lo^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

356 Citations (Scopus)

Abstract

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 Transform. Numerical examples are presented to verify that EMD/EEMD is, in fact, a computationally efficient method.

Original language	English
Pages (from-to)	159-167
Number of pages	9
Journal	Physica A: Statistical Mechanics and its Applications
Volume	400
DOIs	https://doi.org/10.1016/j.physa.2014.01.020
Publication status	Published - 15 Apr 2014
Externally published	Yes

Keywords

Complexity
EEMD
EMD
Space
Time

Access to Document

10.1016/j.physa.2014.01.020

Cite this

@article{7ef52736ce2046b882294aa0ec99491c,

title = "On the computational complexity of the empirical mode decomposition algorithm",

abstract = "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 Transform. Numerical examples are presented to verify that EMD/EEMD is, in fact, a computationally efficient method.",

keywords = "Complexity, EEMD, EMD, Space, Time",

author = "Wang, {Yung Hung} and Yeh, {Chien Hung} and Young, {Hsu Wen Vincent} and Kun Hu and Lo, {Men Tzung}",

year = "2014",

month = apr,

day = "15",

doi = "10.1016/j.physa.2014.01.020",

language = "English",

volume = "400",

pages = "159--167",

journal = "Physica A: Statistical Mechanics and its Applications",

issn = "0378-4371",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On the computational complexity of the empirical mode decomposition algorithm

AU - Wang, Yung Hung

AU - Yeh, Chien Hung

AU - Young, Hsu Wen Vincent

AU - Hu, Kun

AU - Lo, Men Tzung

PY - 2014/4/15

Y1 - 2014/4/15

N2 - 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 Transform. Numerical examples are presented to verify that EMD/EEMD is, in fact, a computationally efficient method.

AB - 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 Transform. Numerical examples are presented to verify that EMD/EEMD is, in fact, a computationally efficient method.

KW - Complexity

KW - EEMD

KW - EMD

KW - Space

KW - Time

UR - http://www.scopus.com/inward/record.url?scp=84893194518&partnerID=8YFLogxK

U2 - 10.1016/j.physa.2014.01.020

DO - 10.1016/j.physa.2014.01.020

M3 - Article

AN - SCOPUS:84893194518

SN - 0378-4371

VL - 400

SP - 159

EP - 167

JO - Physica A: Statistical Mechanics and its Applications

JF - Physica A: Statistical Mechanics and its Applications

ER -

On the computational complexity of the empirical mode decomposition algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this