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

12/23/2017
by   Paul Catala, et al.
0

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 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.

READ FULL TEXT
research
05/03/2023

Multi-dimensional Signal Recovery using Low-rank Deconvolution

In this work we present Low-rank Deconvolution, a powerful framework for...
research
05/18/2021

Barrier and penalty methods for low-rank semidefinite programming with application to truss topology design

The aim of this paper is to solve large-and-sparse linear Semidefinite P...
research
11/21/2022

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

We present a sublinear query algorithm for outputting a near-optimal low...
research
03/12/2020

Low-Rank and Total Variation Regularization and Its Application to Image Recovery

In this paper, we study the problem of image recovery from given partial...
research
09/26/2021

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach

We study the Sparse Plus Low Rank decomposition problem (SLR), which is ...
research
01/10/2020

Deformable Groupwise Image Registration using Low-Rank and Sparse Decomposition

Low-rank and sparse decompositions and robust PCA (RPCA) are highly succ...
research
01/04/2023

The dimension of an orbitope based on a solution to the Legendre pair problem

The Legendre pair problem is a particular case of a rank-1 semidefinite ...

Please sign up or login with your details

Forgot password? Click here to reset