An algorithm for non-convex off-the-grid sparse spike estimation with a minimum separation constraint

12/02/2020
by   Yann Traonmilin, et al.
0

Theoretical results show that sparse off-the-grid spikes can be estimated from (possibly compressive) Fourier measurements under a minimum separation assumption. We propose a practical algorithm to minimize the corresponding non-convex functional based on a projected gradient descent coupled with an initialization procedure. We give qualitative insights on the theoretical foundations of the algorithm and provide experiments showing its potential for imaging problems.

READ FULL TEXT
research
11/29/2018

The basins of attraction of the global minimizers of the non-convex sparse spikes estimation problem

The sparse spike estimation problem consists in estimating a number of o...
research
09/18/2020

The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension

Non-convex methods for linear inverse problems with low-dimensional mode...
research
12/22/2020

Learning to Initialize Gradient Descent Using Gradient Descent

Non-convex optimization problems are challenging to solve; the success a...
research
02/26/2013

Convex vs nonconvex approaches for sparse estimation: GLasso, Multiple Kernel Learning and Hyperparameter GLasso

The popular Lasso approach for sparse estimation can be derived via marg...
research
04/18/2022

Fully-Decentralized Alternating Projected Gradient Descent for Low Rank column-wise Compressive Sensing

This work develops a provably accurate fully-decentralized fast and comm...
research
03/02/2023

A note on spike localization for line spectrum estimation

This note considers the problem of approximating the locations of domina...
research
03/02/2021

Structural Sparsity in Multiple Measurements

We propose a novel sparsity model for distributed compressed sensing in ...

Please sign up or login with your details

Forgot password? Click here to reset