arXiv subjects

Antonio Cicone

Publications and source records attributed to Antonio Cicone.

At least 19 recordsLinked to original sources

arXiv2026

Graph Iterative Filtering methods for the analysis of nonstationary signals on graphs

In the analysis of real-world data, extracting meaningful features from signals is a crucial task. This is particularly challenging when signals contain non-stationary frequency components. The Iterative Filtering (IF) method has proven to be an effective tool for decomposing such signals. However, such a technique cannot handle directly data that have been sampled non-uniformly. On the other hand, graph signal processing has gained increasing attention due to its versatility and wide range of applications, and it can handle data sampled both uniformly and non-uniformly. In this work, we propose two algorithms that extend the IF method to signals defined on graphs. In addition, we provide a unified convergence analysis for the different IF variants. Finally, numerical experiments on a variety of graphs, including real-world data, confirm the effectiveness of the proposed methods. In particular, we test our algorithms on seismic data and the total electron content of the ionosphere. Those data are by their nature non-uniformly sampled, and, therefore, they cannot be directly analyzed by the standard IF method.

math.NA↗

arXiv2026

On the Instantaneous Phase and Frequency Estimation of a Non-Stationary Multicomponent Signal. The JADE Algorithm

Many real-life signals, such as gravitational wave measurements, biomedical signals, or geophysical data, are strongly non-stationary but can be decomposed into mono-component signals that contain only one active frequency over time. This is made possible thanks to decomposition methods developed in recent years that can handle non-stationary signals. The problem now is how to compute, in an accurate and stable way, the instantaneous frequency, phase, and amplitude of such mono-component signals. Numerous approaches have been developed so far, but they can be unstable in the presence of noise and struggle to capture quick and intrawave changes in frequency. In this work, we present an alternative approach, called the JADE method, which is based on the Dynamic Time Warping algorithm and which we combine with the FIF algorithm to handle and study multicomponent non-stationary signals. We test the robustness of JADE to noise and run comparisons with classical methods used for instantaneous frequency, phase, and amplitude estimation.

eess.SP↗

arXiv2026

Angles, orthogonality, and Pythagorean theorem in Banach spaces with two related applications

In the current work, we propose a generalization of angles and orthogonality from $L^2$ to generic Banach spaces, starting from a $L^p$ version of the Pythagorean theorem, $p\in [1,\infty)$. The starting point is conservation of energy measured in $L^1$ norm, as it occurs when considering the intrinsic mode functions decomposition in signal processing. This conservation of energy measure in $L^1$ norm is exactly the $L^1$ Pythagorean theorem. Besides the theoretical analysis, we apply the new notions in the context of preconditioning for structured large linear systems, by obtaining new classes of preconditioners. The present work contains numerical experiments and various remarks on the possible use of the given framework.

math.GM↗

arXiv2024

A novel algorithm for the decomposition of non-stationary multidimensional and multivariate signals

The decomposition of a signal is a fundamental tool in many fields of research, including signal processing, geophysics, astrophysics, engineering, medicine, and many more. By breaking down complex signals into simpler oscillatory components we can enhance the understanding and processing of the data, unveiling hidden information contained in them. Traditional methods, such as Fourier analysis and wavelet transforms, which are effective in handling mono-dimensional stationary signals struggle with non-stationary data sets and they require, this is the case of the wavelet, the selection of predefined basis functions. In contrast, the Empirical Mode Decomposition (EMD) method and its variants, such as Iterative Filtering (IF), have emerged as effective nonlinear approaches, adapting to signals without any need for a priori assumptions. To accelerate these methods, the Fast Iterative Filtering (FIF) algorithm was developed, and further extensions, such as Multivariate FIF (MvFIF) and Multidimensional FIF (FIF2), have been proposed to handle higher-dimensional data. In this work, we introduce the Multidimensional and Multivariate Fast Iterative Filtering (MdMvFIF) technique, an innovative method that extends FIF to handle data that vary simultaneously in space and time. This new algorithm is capable of extracting Intrinsic Mode Functions (IMFs) from complex signals that vary in both space and time, overcoming limitations found in prior methods. The potentiality of the proposed method is demonstrated through applications to artificial and real-life signals, highlighting its versatility and effectiveness in decomposing multidimensional and multivariate nonstationary signals. The MdMvFIF method offers a powerful tool for advanced signal analysis across many scientific and engineering disciplines.

math.NA↗

arXiv2024

IRCNN$^{+}$: An Enhanced Iterative Residual Convolutional Neural Network for Non-stationary Signal Decomposition

Time-frequency analysis is an important and challenging task in many applications. Fourier and wavelet analysis are two classic methods that have achieved remarkable success in many fields. However, they also exhibit limitations when applied to nonlinear and non-stationary signals. To address this challenge, a series of nonlinear and adaptive methods, pioneered by the empirical mode decomposition method, have been proposed. The goal of these methods is to decompose a non-stationary signal into quasi-stationary components that enhance the clarity of features during time-frequency analysis. Recently, inspired by deep learning, we proposed a novel method called iterative residual convolutional neural network (IRCNN). IRCNN not only achieves more stable decomposition than existing methods but also handles batch processing of large-scale signals with low computational cost. Moreover, deep learning provides a unique perspective for non-stationary signal decomposition. In this study, we aim to further improve IRCNN with the help of several nimble techniques from deep learning and optimization to ameliorate the method and overcome some of the limitations of this technique.

cs.LG↗

arXiv2024

Stabilization and Variations to the Adaptive Local Iterative Filtering Algorithm: the Fast Resampled Iterative Filtering Method

Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component signals into simple oscillatory mono-components, like the groundbreaking Empirical Mode Decomposition technique and the Iterative Filtering method. When a signal contains mono-components that have rapid varying instantaneous frequencies, we can think, for instance, to chirps or whistles, it becomes particularly hard for most techniques to properly factor out these components. The Adaptive Local Iterative Filtering technique has recently gained interest in many applied fields of research for being able to deal with non-stationary signals presenting amplitude and frequency modulation. In this work, we address the open question of how to guarantee a priori convergence of this technique, and propose two new algorithms. The first method, called Stable Adaptive Local Iterative Filtering, is a stabilized version of the Adaptive Local Iterative Filtering that we prove to be always convergent. The stability, however, comes at the cost of higher complexity in the calculations. The second technique, called Resampled Iterative Filtering, is a new generalization of the Iterative Filtering method. We prove that Resampled Iterative Filtering is guaranteed to converge a priori for any kind of signal. Furthermore, in the discrete setting, by leveraging on the mathematical properties of the matrices involved, we show that its calculations can be accelerated drastically. Finally, we present some artificial and real-life examples to show the powerfulness and performance of the proposed methods.

math.NA↗

arXiv2023

Extension and convergence analysis of Iterative Filtering to spherical data

Many real-life signals are defined on spherical domains, in particular in geophysics and physics applications. In this work, we tackle the problem of extending the iterative filtering algorithm, developed for the decomposition of non-stationary signals defined in Euclidean spaces, to spherical domains. We review the properties of the classical Iterative Filtering method, present its extension, and study its convergence in the discrete setting. In particular, by leveraging the Generalized Locally Toeplitz sequence theory, we are able to characterize spectrally the operators associated with the spherical extension of Iterative Filtering, and we show a counterexample of its convergence. Finally, we propose a convergent version, called Spherical Iterative Filtering, and present numerical results of its application to spherical data.

math.NA↗

arXiv2023

Gamma-Ray Burst observations by the high-energy charged particle detector on board the CSES-01 satellite between 2019 and 2021

In this paper we report the detection of five strong Gamma-Ray Bursts (GRBs) by the High-Energy Particle Detector (HEPD-01) mounted on board the China Seismo-Electromagnetic Satellite (CSES-01), operational since 2018 on a Sun-synchronous polar orbit at a $\sim$ 507 km altitude and 97$^\circ$ inclination. HEPD-01 was designed to detect high-energy electrons in the energy range 3 - 100 MeV, protons in the range 30 - 300 MeV, and light nuclei in the range 30 - 300 MeV/n. Nonetheless, Monte Carlo simulations have shown HEPD-01 is sensitive to gamma-ray photons in the energy range 300 keV - 50 MeV, even if with a moderate effective area above $\sim$ 5 MeV. A dedicated time correlation analysis between GRBs reported in literature and signals from a set of HEPD-01 trigger configuration masks has confirmed the anticipated detector sensitivity to high-energy photons. A comparison between the simultaneous time profiles of HEPD-01 electron fluxes and photons from GRB190114C, GRB190305A, GRB190928A, GRB200826B and GRB211211A has shown a remarkable similarity, in spite of the different energy ranges. The high-energy response, with peak sensitivity at about 2 MeV, and moderate effective area of the detector in the actual flight configuration explain why these five GRBs, characterised by a fluence above $\sim$ 3 $\times$ 10$^{-5}$ erg cm$^{-2}$ in the energy interval 300 keV - 50 MeV, have been detected.

astro-ph.HE↗

arXiv2023

RRCNN: A novel signal decomposition approach based on recurrent residue convolutional neural network

The decomposition of non-stationary signals is an important and challenging task in the field of signal time-frequency analysis. In the recent two decades, many signal decomposition methods led by the empirical mode decomposition, which was pioneered by Huang et al. in 1998, have been proposed by different research groups. However, they still have some limitations. For example, they are generally prone to boundary and mode mixing effects and are not very robust to noise. Inspired by the successful applications of deep learning in fields like image processing and natural language processing, and given the lack in the literature of works in which deep learning techniques are used directly to decompose non-stationary signals into simple oscillatory components, we use the convolutional neural network, residual structure and nonlinear activation function to compute in an innovative way the local average of the signal, and study a new non-stationary signal decomposition method under the framework of deep learning. We discuss the training process of the proposed model and study the convergence analysis of the learning algorithm. In the experiments, we evaluate the performance of the proposed model from two points of view: the calculation of the local average and the signal decomposition. Furthermore, we study the mode mixing, noise interference, and orthogonality properties of the decomposed components produced by the proposed method. All results show that the proposed model allows for better handling boundary effect, mode mixing effect, robustness, and the orthogonality of the decomposed components than existing methods.

cs.LG↗

arXiv2022

Conjectures on spectral properties of ALIF algorithm

A new decomposition method for nonstationary signals, named Adaptive Local Iterative Filtering (ALIF), has been recently proposed in the literature. Given its similarity with the Empirical Mode Decomposition (EMD) and its more rigorous mathematical structure, which makes feasible to study its convergence compared to EMD, ALIF has really good potentiality to become a reference method in the analysis of signals containing strong nonstationary components, like chirps, multipaths and whistles, in many applications, like Physics, Engineering, Medicine and Finance, to name a few. In [11], the authors analyzed the spectral properties of the matrices produced by the ALIF method, in order to study its stability. Various results are achieved in that work through the use of Generalized Locally Toeplitz (GLT) sequences theory, a powerful tool originally designed to extract information on the asymptotic behavior of the spectra for PDE discretization matrices. In this manuscript we focus on answering some of the open questions contained in [11], and in doing so, we also develop new theory and results for the GLT sequences.

math.NA↗

arXiv2022

New theoretical insights in the decomposition and time-frequency representation of nonstationary signals: the IMFogram algorithm

The analysis of the time-frequency content of a signal is a classical problem in signal processing, with a broad number of applications in real life. Many different approaches have been developed over the decades, which provide alternative time-frequency representations of a signal each with its advantages and limitations. In this work, following the success of nonlinear methods for the decomposition of signals into intrinsic mode functions (IMFs), we first provide more theoretical insights into the so-called Iterative Filtering decomposition algorithm, proving an energy conservation result for the derived decompositions. Furthermore, we present a new time-frequency representation method based on the IMF decomposition of a signal, which is called IMFogram. We prove theoretical results regarding this method, including its convergence to the spectrogram representation for a certain class of signals, and we present a few examples of applications, comparing results with some of the most well know approaches available in the literature.

math.NA↗

arXiv2022

Tailoring 2D Fast Iterative Filtering algorithm for low-contrast optical fringe pattern preprocessing

Retrieving object phase from the optical fringe pattern is a critical task in quantitative phase imaging and often requires appropriate image preprocessing (background and noise minimization), especially when retrieving phase from the single-shot fringe pattern image. In this article, for the first time, we propose to adapt the 2D Fast Iterative Filtering (FIF) method for fringe pattern decomposition and develop a novel version of FIF called the 2D fringe pattern Fast Iterative Filtering (fpFIF2), that is tailored for fringe pattern preprocessing. We show the positive influence of fpFIF2 onto fringe pattern filtering comparing to the previous 2D FIF implementation regarding processing speed, quality, and usage comfortability. We also compare the fpFIF2 with other state-of-the-art fringe pattern filtering methods in terms of aiding the Hilbert spiral transform method in phase retrieval. Employing numerical simulations and experimental fringe analysis, we prove that fpFIF2 outperforms reference methods, especially in terms of low-fringe-contrast phase reconstruction quality and decomposition time.

physics.optics↗

arXiv2021

One or two frequencies? The Iterative Filtering answers

The Iterative Filtering method is a technique aimed at the decomposition of non-stationary and non-linear signals into simple oscillatory components. This method, proposed a decade ago as an alternative technique to the Empirical Mode Decomposition, has been used extensively in many applied fields of research and studied, from a mathematical point of view, in several papers published in the last few years. However, even if its convergence and stability are now established both in the continuous and discrete setting, it is still an open problem to understand up to what extent this approach can separate two close-by frequencies contained in a signal. In this paper, following the studies conducted on the Empirical Mode Decomposition and the Synchrosqueezing methods, we analyze in detail the abilities of the Iterative Filtering algorithm in extracting two stationary frequencies from a given signal. In particular, after reviewing the Iterative Filtering technique and its known properties, we present new theoretical results and numerical evidence showing the ability of this technique in addressing the fundamental "one or two frequencies" question.

math.NA↗

arXiv2021

Multivariate Fast Iterative Filtering for the decomposition of nonstationary signals

In this work, we present a new technique for the decomposition of multivariate data, which we call Multivariate Fast Iterative Filtering (MvFIF) algorithm. We study its properties, proving rigorously that it converges in finite time when applied to the decomposition of any kind of multivariate signal. We test MvFIF performance using a wide variety of artificial and real multivariate signals, showing its ability to: separate multivariate modulated oscillations; align frequencies along different channels; produce a quasi--dyadic filterbank when decomposing white Gaussian noise; decompose the signal in a quasi--orthogonal set of components; being robust to noise perturbation, even when the number of channels is increased considerably. Finally, we compare its performance with the one of the main methods developed so far in the literature, proving that MvFIF produces, without any a priori assumption on the signal under investigation and in a fast and reliable manner, a uniquely defined decomposition of any multivariate signal.

math.NA↗

arXiv2021

Spacetime Hall-MHD turbulence at sub-ion scales: structures or waves?

Spatiotemporal properties of two-dimensional (2D) Hall-magnetohydrodynamic turbulence at intermediate plasma $β=2$ are studied by means of Fast Iterative Filtering, a new technique for the decomposition of nonstationary nonlinear signals. Results show that the magnetic energy at sub-ion scales is concentrated in perturbations with frequencies smaller than the ion-cyclotron (IC) frequency and with polarization properties that are incompatible with both kinetic Alfvén waves (KAWs) and IC waves. At higher frequencies, we clearly identify signatures of both whistler waves and KAWs, however their energetic contribution to the magnetic power spectrum is negligible. We conclude that the dynamics of 2D Hall-MHD turbulence at sub-ion scales is mainly driven by localized intermittent structures, with no significant contribution of wavelike fluctuations.

physics.plasm-ph↗

arXiv2021

Time-frequency representation of nonstationary signals: the IMFogram

Iterative filtering methods were introduced around 2010 to improve definitions and measurements of structural features in signal processing. Like many applied techniques, they present considerable challenges for mathematicians to theorize their effectiveness and limitations in commercial and scientific usages. In this paper we recast iterative filtering methods in a mathematical abstraction more conducive to their understanding and applications. We also introduce a new visualization of simultaneous local frequencies and amplitudes. By combining a theoretical and practical exposition, we hope to stimulate efforts to understand better these methods. Our approach acknowledges the influence of Ciprian Foias, who was passionate about pure, applied, and applications of mathematics.

math.NA↗

arXiv2020

Convergence analysis of Adaptive Locally Iterative Filtering and SIFT method

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.

math.NA↗

arXiv2020

Multidimensional Iterative Filtering: a new approach for investigating plasma turbulence in numerical simulations

Turbulent space and astrophysical plasmas exhibit a complex dynamics, which involves nonlinear coupling across different temporal and spatial scales. There is growing evidence that impulsive events, such as magnetic reconnection instabilities, lead to a spatially localized enhancement of energy dissipation, thus speeding up the energy transfer at small scales. Capturing such a diverse dynamics is challenging. Here, we employ the Multidimensional Iterative Filtering (MIF) method, a novel technique for the analysis of nonstationary multidimensional signals. Unlike other traditional methods (e.g., based on Fourier or wavelet decomposition), MIF does not require any previous assumption on the functional form of the signal to be identified. Using MIF, we carry out a multiscale analysis of Hall-magnetohydrodynamic (HMHD) and hybrid particle-in-cell (HPIC) numerical simulations of decaying plasma turbulence. The results assess the ability of MIF to spatially identify and separate the different scales (the MHD inertial range, the sub-ion kinetic, and the dissipation scales) of the plasma dynamics. Furthermore, MIF decomposition allows to detect localized current structures and to characterize their contribution to the statistical and spectral properties of turbulence. Overall, MIF arises as a very promising technique for the study of turbulent plasma environments.

physics.plasm-ph↗