Signal Recovery in Perturbed Fourier Compressed Sensing
Eeshan Malhotra, Himanshu Pandotra, Ajit Rajwade, Karthik S., Gurumoorthy

TL;DR
This paper introduces an alternating minimization algorithm to accurately recover signals and unknown frequency perturbations in Fourier compressed sensing, improving robustness and accuracy over existing methods.
Contribution
It proposes a novel in situ perturbation recovery method for Fourier measurements in compressed sensing, with theoretical convergence and uniqueness guarantees.
Findings
Significantly better recovery quality than baseline algorithms.
Robust performance in noisy measurement conditions.
Effective recovery of small parameter sets P << M.
Abstract
In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified `base' frequencies , where is the number of measurements. However due to system calibration errors, the system may measure the Fourier transform at frequencies that are different from the base frequencies and where are unknown. Ignoring perturbations of this nature can lead to major errors in signal recovery. In this paper, we present a simple but effective alternating minimization algorithm to recover the perturbations in the frequencies \emph{in situ} with the signal, which we assume is sparse or compressible in some known basis. In many cases, the perturbations can be expressed in terms of a small number of unique…
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.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Blind Source Separation Techniques · Direction-of-Arrival Estimation Techniques
