A Low-Rank Approach to Off-The-Grid Sparse Deconvolution

Abstract

We propose a new solver for the sparse spikes deconvolution problem over the space of Radon measures. A common approach to off-the-grid deconvolution considers semidefinite (SDP) relaxations of the total variation (the total mass of the absolute value of the measure) minimization problem. The direct resolution of this SDP is however intractable for large scale settings, since the problem size grows as $f_c^{2d}$ where $f_c$ is the cutoff frequency of the filter and $d$ the ambient dimension. Our first contribution introduces a penalized formulation of this semidefinite lifting, which has low-rank solutions. Our second contribution is a conditional gradient optimization scheme with non-convex updates. This algorithm leverages both the low-rank and the convolutive structure of the problem, resulting in an $O(f_c^d\log f_c)$ complexity per iteration. Numerical simulations are promising and show that the algorithm converges in exactly $r$ steps, $r$ being the number of Diracs composing the solution.

Cited by in corpus (6)

• The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
• Two-Dimensional Super-Resolution via Convex Relaxation
• Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization
• When does OMP achieve exact recovery with continuous dictionaries?
• Cell Detection by Functional Inverse Diffusion and Non-negative Group Sparsity$-$Part I: Modeling and Inverse Problems
• Sparse Pursuit and Dictionary Learning for Blind Source Separation in Polyphonic Music Recordings