Robust Recovery of Stream of Pulses using Convex Optimization
Preprint
Abstract
This paper considers the problem of recovering the delays and amplitudes of a weighted superposition of pulses. This problem is motivated by a variety of applications such as ultrasound and radar. We show that for univariate and bivariate stream of pulses, one can recover the delays and weights to any desired accuracy by solving a tractable convex optimization problem, provided that a pulse-dependent separation condition is satisfied. The main result of this paper states that the recovery is robust to additive noise or model mismatch.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Positive Trigonometric Polynomials and Signal Processing Applications2017
- MUSIC for single-snapshot spectral estimation: Stability and super-resolutionApplied and Computational Harmonic Analysis, 2016
- Spike detection from inaccurate samplingsApplied and Computational Harmonic Analysis, 2015
- Exact Support Recovery for Sparse Spikes DeconvolutionFoundations of Computational Mathematics, 2014
- Exact Recovery of Dirac Ensembles from the Projection Onto Spaces of Spherical HarmonicsConstructive Approximation, 2014
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomialsJournal of Approximation Theory, 2014
- Towards a Mathematical Theory of Super‐resolutionCommunications on Pure and Applied Mathematics, 2013
- Identifying Linear Combinations of Ridge FunctionsAdvances in Applied Mathematics, 1999
- A Wavelet Tour of Signal Processing1999
- Representation in Lp by Series of Translates and Dilates of One FunctionJournal of Approximation Theory, 1995