SRMD: Sparse Random Mode Decomposition
Nicholas Richardson, Hayden Schaeffer, Giang Tran

TL;DR
SRMD introduces a sparse, randomized approach to time-frequency analysis that efficiently decomposes signals into intrinsic modes, outperforming existing methods in accuracy and computational cost.
Contribution
The paper presents a novel sparse random feature method for signal decomposition that improves efficiency and mode separation in time-frequency analysis.
Findings
Outperforms state-of-the-art decomposition methods on benchmarks.
Reduces sampling and computational costs through randomization.
Effectively separates time-frequency clusters for intrinsic mode identification.
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 the benchmark tests, we show that our approach outperforms other state-of-the-art decomposition methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Fault Diagnosis Techniques · Blind Source Separation Techniques · Machine Learning in Bioinformatics
