Robust Recovery of Stream of Pulses using Convex Optimization
Authors:
- Tamir BendoryTBTamir Bendory
- Shai DekelSDShai Dekel
- Arie FeuerAFArie Feuer
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 depended separation condition is satisfied. Furthermore, we prove and demonstrate by numerical experiments that the recovery is robust to additive noise or model mismatch.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Spike detection from inaccurate samplingsApplied and Computational Harmonic Analysis, 2015
- 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
- Sub-Nyquist Radar via Doppler FocusingIEEE Transactions on Signal Processing, 2014
- Compressed Beamforming in Ultrasound ImagingIEEE Transactions on Signal Processing, 2012
- Sensitivity to Basis Mismatch in Compressed SensingIEEE Transactions on Signal Processing, 2011
- Innovation Rate Sampling of Pulse Streams With Application to Ultrasound ImagingIEEE Transactions on Signal Processing, 2011
- Error function inequalitiesAdvances in Computational Mathematics, 2009