Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexity
Not on the map. Why?
Abstract (arXiv)
We propose a multi-tone decomposition algorithm that can find the frequencies, amplitudes and phases of the fundamental sinusoids in a noisy observation sequence. Under independent identically distributed Gaussian noise, our method utilizes a maximum likelihood approach to estimate the relevant tone parameters from the contaminated observations. When estimating M number of sinusoidal sources, our algorithm successively estimates their frequencies and jointly optimizes their amplitudes and phases. Our method can also be implemented as a blind source separator in the absence of the information about M. The computational complexity of our algorithm is near-linear, i.e., tildeO(N).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 77 references that are in the map. First posted on arXiv 27 Mar 2022.
Builds on
7 of 77 references.
References · 7
- 2021Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statisticscited by 32
- 2018Sequential Outlier Detection based on Incremental Decision Treescited by 21
- 2021Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clusteringcited by 12
- 2022Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functionscited by 11
- 2021Cumulative Regret Analysis of the Piyavskii--Shubert Algorithm and Its Variants for Global Optimizationcited by 9
- 2022Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statisticscited by 8
- 2022Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windowscited by 3
Built on by
Citing papers per year: 2022: 1.
1 paper.