2021
DOI: 10.1007/s00211-020-01165-5
|View full text |Cite
|
Sign up to set email alerts
|

Numerical analysis for iterative filtering with new efficient implementations based on FFT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
72
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 70 publications
(74 citation statements)
references
References 91 publications
2
72
0
Order By: Relevance
“…The key difference is in the signal moving average computed in IF, which is obtained as the convolution of the signal s(t) with an a priori chosen filter function w(t). This apparently small difference between the way IF and EMD compute the moving average opened the doors to the mathematical analysis of IF [53,56,57,[59][60][61] such as the demonstration of its a priori convergence [56,57,61] and its acceleration [59,61] in what is called the Fast Iterative Filtering (FIF) method. FIF allows us to compute the exact same decomposition as IF when the signal is extended periodically at the boundaries.…”
Section: Non-stationary Signal Decomposition and Their Multiscale Statistical Analysis: The Fast Iterative Filtering Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The key difference is in the signal moving average computed in IF, which is obtained as the convolution of the signal s(t) with an a priori chosen filter function w(t). This apparently small difference between the way IF and EMD compute the moving average opened the doors to the mathematical analysis of IF [53,56,57,[59][60][61] such as the demonstration of its a priori convergence [56,57,61] and its acceleration [59,61] in what is called the Fast Iterative Filtering (FIF) method. FIF allows us to compute the exact same decomposition as IF when the signal is extended periodically at the boundaries.…”
Section: Non-stationary Signal Decomposition and Their Multiscale Statistical Analysis: The Fast Iterative Filtering Algorithmmentioning
confidence: 99%
“…We decomposed the diurnal vTEC observations using the FIF method, which we briefly recalled in Section 2.5. The interested reader can find more details on this algorithm and its pseudo-code in [59,61] FIF code for Matlab is freely available at www.cicone.com);…”
Section: Vertical Total Electron Content Observationsmentioning
confidence: 99%
“…In particular, we mention here its low computational complexity which makes it the fastest technique of its kind; the guaranteed uniqueness of the derived decompositions; a complete mathematical framework; and a complete adaptivity to the signal under investigation ensuring that there is no need to set a priori neither the number of components to be extracted nor the basis to be used in the process. Interested readers can find more details in [2], [4], [9].…”
Section: A Fast Iterative Filtering (Fif)mentioning
confidence: 99%
“…Cross Correlation (IMXC spelled I-M-cross-C) method, for the scale-wise measurement of lags between two complex and non-stationary signals. We leverage on the Multivariate Fast Iterative Filtering (MvFIF) [2] technique, being the multivariate implementation of the Fast Iterative Filtering (FIF) technique [4]. The lags are then identified on a scale-by-scale basis by using the maximum cross correlation among homogeneous modes.…”
Section: Introductionmentioning
confidence: 99%
“…The first locally adaptive data-driven method, empirical mode decomposition (EMD), proposed by Huang [3], is very suitable for dealing with non-stationary and nonlinear signals, but there are some issues such as over-envelope, mode mixing, and end effect under strong background noise [4,5]. Smith and Cicone respectively proposed local mean decomposition (LMD) [6] and adaptive local iterative filtering (ALIF) [7] recursive mode decomposition methods similar to EMD, which mitigated the influence of mode mixing and end effect.…”
Section: Introductionmentioning
confidence: 99%