Sparse recovery over continuous dictionaries-just discretize
Authors:
- 1 November 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1043-1047
Abstract
In many applications of sparse recovery, the signal has a sparse representation only with respect to a continuously parameterized dictionary. Although atomic norm minimization provides a general framework to handle sparse recovery over continuous dictionaries, the computational aspects largely remain unclear. By establishing various convergence results as the discretization gets finer, we promote discretization as a universal and effective way to approximately solve the atomic norm minimization problem, especially when the dimension of the parameter space is low.Keywords
This publication has 8 references indexed in Scilit:
- Compressed Sensing Off the GridIEEE Transactions on Information Theory, 2013
- Atomic Norm Denoising With Applications to Line Spectral EstimationIEEE Transactions on Signal Processing, 2013
- Towards a Mathematical Theory of Super‐resolutionCommunications on Pure and Applied Mathematics, 2013
- The Convex Geometry of Linear Inverse ProblemsFoundations of Computational Mathematics, 2012
- Faster STORM using compressed sensingNature Methods, 2012
- Sensitivity to Basis Mismatch in Compressed SensingIEEE Transactions on Signal Processing, 2011
- Semi-infinite programming, duality, discretization and optimality conditions†Optimization, 2009
- Discretization in semi-infinite programming: the rate of convergenceMathematical Programming, 2001