Support Recovery for Sparse Signals with Unknown Non-stationary Modulation
Youye Xie, Michael B. Wakin, Gongguo Tang

TL;DR
This paper addresses the challenge of recovering sparse signals with unknown, non-stationary modulations by formulating it as a structured matrix recovery problem and providing theoretical guarantees for support recovery.
Contribution
It introduces a novel lifting-based approach for sparse recovery with non-stationary modulations, deriving conditions for exact support recovery and error bounds.
Findings
The proposed method successfully recovers the support of sparse signals under certain conditions.
Theoretical bounds on recovery errors are established.
Numerical simulations confirm the effectiveness of the approach in practical applications.
Abstract
The problem of estimating a sparse signal from low dimensional noisy observations arises in many applications, including super resolution, signal deconvolution, and radar imaging. In this paper, we consider a sparse signal model with non-stationary modulations, in which each dictionary atom contributing to the observations undergoes an unknown, distinct modulation. By applying the lifting technique, under the assumption that the modulating signals live in a common subspace, we recast this sparse recovery and non-stationary blind demodulation problem as the recovery of a column-wise sparse matrix from structured linear observations, and propose to solve it via block -norm regularized quadratic minimization. Due to observation noise, the sparse signal and modulation process cannot be recovered exactly. Instead, we aim to recover the sparse support of the ground truth signal and…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
