Demixing Sines and Spikes Using Multiple Measurement Vectors
arXiv:2004.00259 · doi:10.1016/j.sigpro.2022.108786
Abstract
In this paper, we address the line spectral estimation problem with multiple measurement corrupted vectors. Such scenarios appear in many practical applications such as radar, optics, and seismic imaging in which the signal of interest can be modeled as the sum of a spectrally sparse and a blocksparse signal known as outlier. Our aim is to demix the two components and for that, we design a convex problem whose objective function promotes both of the structures. Using positive trigonometric polynomials (PTP) theory, we reformulate the dual problem as a semi-definite program (SDP). Our theoretical results states that for a fixed number of measurements N and constant number of outliers, up to O(N) spectral lines can be recovered using our SDP problem as long as a minimum frequency separation condition is satisfied. Our simulation results also show that increasing the number of samples per measurement vectors, reduces the minimum required frequency separation for successful recovery.
arXiv comment33 pages, 8 figures. Signal Processing (2022)
References in corpus (12)
- The Convex Geometry of Linear Inverse Problems
- User-friendly tail bounds for sums of random matrices
- A discretization-free sparse and parametric approach for linear array signal processing
- Super-resolution Method for Coherent DOA Estimation of Multiple Wideband Sources
- Two-Dimensional Super-Resolution via Convex Relaxation
- Exploiting Prior Information in Block Sparse Signals
- Blind Goal-Oriented Massive Access for Future Wireless Networks
- Living near the edge: A lower-bound on the phase transition of total variation minimization
- On the Error in Phase Transition Computations for Compressed Sensing
- Sample Complexity of Total Variation Minimization
- Distribution-aware Block-sparse Recovery via Convex Optimization
- Sparse Methods for Direction-of-Arrival Estimation