Numerical Analysis for Iterative Filtering with New Efficient Implementations Based on FFT

2018/02/05 by Antonio Cicone, Haomin Zhou, Cicone, Antonio +1 · 1 citation
Computer Science · Engineering · #Advanced Electrical Measurement Techniques #FOS: Mathematics #Image and Signal Denoising Methods #Numerical Analysis (math.NA) #Structural Health Monitoring Techniques

paper · pdf · doi:10.48550/arxiv.1802.01359

openalex publication_date 2018/02/05 · openalex created_date 2018/11/02 · openalex updated_date 2026/07/28

Abstract

Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem of further analyzing the convergence of the Iterative Filtering method both in a continuous and a discrete setting in order to provide a comprehensive analysis of its behavior. Based on these results we provide new ideas for efficient implementations of Iterative Filtering algorithm which are based on Fast Fourier Transform (FFT), and the reduction of the original iterative algorithm to a direct method.

Cited by

• Continuous-Domain Fractional Derivative Model for Signal Decomposition

Related

• Iterative Filtering as a direct method for the decomposition of non-stationary signals
• Study of boundary conditions in the Iterative Filtering method for the\n decomposition of nonstationary signals
• Multidimensional Iterative Filtering method for the decomposition of high-dimensional non-stationary signals
• Convergence analysis of Adaptive Locally Iterative Filtering and SIFT method
• Adaptive Local Iterative Filtering for Signal Decomposition and Instantaneous Frequency analysis