BÉNARD, Pierre-Jean; TRAONMILIN, Yann; AUJOL, Jean François

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

BÉNARD, Pierre-Jean
Institut de Mathématiques de Bordeaux [IMB]

TRAONMILIN, Yann
Institut de Mathématiques de Bordeaux [IMB]

AUJOL, Jean François
Institut de Mathématiques de Bordeaux [IMB]

Langue

Document de travail - Pré-publication

Résumé en anglais

We consider the problem of recovering off-the-grid spikes from linear measurements. The state of the art Over-Parametrized Continuous Orthogonal Matching Pursuit (OP-COMP) with Projected Gradient Descent (PGD) successfully recovers those signals. In most cases, the main computational cost lies in a unique global descent on all parameters (positions and amplitudes). In this paper, we propose to improve this algorithm by accelerating this descent step. We introduce a new algorithm, based on Block Coordinate Descent, that takes advantages of the sparse structure of the problem. Based on qualitative theoretical results, this algorithm shows improvement in calculation times in realistic synthetic microscopy experiments.< Réduire

Mots clés en anglais

spike super-resolution

non-convex optimization

over-parametrization

block-coordinate descent

URI

https://oskar-bordeaux.fr/handle/20.500.12278/190230

Project ANR

Régularisation performante de problèmes inverses en grande dimension pour le traitement de données - ANR-20-CE40-0001

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251