TY - JOUR
T1 - WHEN RAMANUJAN MEETS TIME-FREQUENCY ANALYSIS IN COMPLICATED TIME SERIES ANALYSIS
AU - Chen, Ziyu
AU - Wu, Hau Tieng
N1 - Publisher Copyright:
© 2022, Mathematical Sciences Publishers. All rights reserved.
PY - 2022
Y1 - 2022
N2 - To handle time series with complicated oscillatory structure, we propose a novel time-frequency (TF) analysis tool that fuses the short-time Fourier transform (STFT) and periodic transform (PT). As many time series oscillate with time-varying frequency, amplitude and nonsinusoidal oscillatory pattern, a direct application of PT or STFT might not be suitable. However, we show that by combining them in a proper way, we obtain a powerful TF analysis tool. We first combine the Ramanujan sums and l1 penalization to implement the PT. We call the algorithm Ramanujan PT (RPT). The RPT is of its own interest for other applications, like analyzing short signals composed of components with integer periods, but that is not the focus of this paper. Second, the RPT is applied to modify the STFT and generate a novel TF representation of the complicated time series that faithfully reflects the instantaneous frequency information of each oscillatory component. We coin the proposed TF analysis the Ramanujan de-shape (RDS) and vectorized RDS (vRDS). In addition to showing some preliminary analysis results on complicated biomedical signals, we provide theoretical analysis about the RPT. Specifically, we show that the RPT is robust to three commonly encountered noises, including envelop fluctuation, jitter and additive noise.
AB - To handle time series with complicated oscillatory structure, we propose a novel time-frequency (TF) analysis tool that fuses the short-time Fourier transform (STFT) and periodic transform (PT). As many time series oscillate with time-varying frequency, amplitude and nonsinusoidal oscillatory pattern, a direct application of PT or STFT might not be suitable. However, we show that by combining them in a proper way, we obtain a powerful TF analysis tool. We first combine the Ramanujan sums and l1 penalization to implement the PT. We call the algorithm Ramanujan PT (RPT). The RPT is of its own interest for other applications, like analyzing short signals composed of components with integer periods, but that is not the focus of this paper. Second, the RPT is applied to modify the STFT and generate a novel TF representation of the complicated time series that faithfully reflects the instantaneous frequency information of each oscillatory component. We coin the proposed TF analysis the Ramanujan de-shape (RDS) and vectorized RDS (vRDS). In addition to showing some preliminary analysis results on complicated biomedical signals, we provide theoretical analysis about the RPT. Specifically, we show that the RPT is robust to three commonly encountered noises, including envelop fluctuation, jitter and additive noise.
KW - de-shape
KW - l regularization
KW - periodicity transform
KW - Ramanujan de-shape
KW - Ramanujan sums
KW - time-frequency analysis
UR - http://www.scopus.com/inward/record.url?scp=85136139526&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85136139526&partnerID=8YFLogxK
U2 - 10.2140/paa.2022.4.629
DO - 10.2140/paa.2022.4.629
M3 - Article
AN - SCOPUS:85136139526
SN - 2578-5893
VL - 4
SP - 629
EP - 673
JO - Pure and Applied Analysis
JF - Pure and Applied Analysis
IS - 4
ER -