SRMD: Sparse Random Mode Decomposition

Nicholas Richardson, Hayden Schaeffer, Giang Tran

Communications on Applied Mathematics and Computation ›› 2023, Vol. 6 ›› Issue (2) : 879-906.

Communications on Applied Mathematics and Computation All Journals
Communications on Applied Mathematics and Computation ›› 2023, Vol. 6 ›› Issue (2) : 879-906. DOI: 10.1007/s42967-023-00273-x
Original Paper

SRMD: Sparse Random Mode Decomposition

Author information +
History +

Abstract

Signal decomposition and multiscale signal analysis provide many useful tools for time-frequency analysis. We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the spectrogram. The randomization is both in the time window locations and the frequency sampling, which lowers the overall sampling and computational cost. The sparsification of the spectrogram leads to a sharp separation between time-frequency clusters which makes it easier to identify intrinsic modes, and thus leads to a new data-driven mode decomposition. The applications include signal representation, outlier removal, and mode decomposition. On benchmark tests, we show that our approach outperforms other state-of-the-art decomposition methods.

Cite this article

Download citation ▾
Nicholas Richardson, Hayden Schaeffer, Giang Tran. SRMD: Sparse Random Mode Decomposition. Communications on Applied Mathematics and Computation, 2023, 6(2): 879‒906 https://doi.org/10.1007/s42967-023-00273-x
This is a preview of subscription content, contact us for subscripton.
Funding
Natural Sciences and Engineering Research Council of Canada(RGPIN 50503-10842); Air Force Office of Scientific Research(MURI FA9550-21-1-0084); Directorate for Mathematical and Physical Sciences(1752116); Natural Sciences and Engineering Research Council of Canada

62

Accesses

2

Citations

Detail

Sections
Recommended

/