REVIEW
Convergence analysis of Adaptive Locally Iterative Filtering and SIFT method
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Convergence analysis of Adaptive Locally Iterative Filtering and SIFT method
read the original abstract
Adaptive Local Iterative Filtering (ALIF) is a currently proposed novel time-frequency analysis tool. It has been empirically shown that ALIF is able to separate components and overcome the mode-mixing problem. However, so far its convergence is still an open problem, particularly for highly nonstationary signals, due to the fact that the kernel associated with ALIF is non-translational invariant, non-convolutional and non-symmetric. Our first contribution in this work is providing a convergence analysis of ALIF. From the practical perspective, ALIF depends on a robust frequencies estimator, based on which the decomposition can be achieved. Our second contribution is proposing a robust and adaptive decomposition method for noisy and nonstationary signals, which we coined the Synchrosqueezing Iterative Filtering Technique (SIFT). In SIFT, we apply the synchrosqueezing transform to estimate the instantaneous frequency, and then apply the ALIF to decompose a signal. We show numerically the ability of this new approach in handling highly nonstationary signals.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.