Uniform k-step recovery with CMF dictionaries - Archive ouverte HAL Access content directly
Conference Papers Year :

Uniform k-step recovery with CMF dictionaries

(1) , (1) , (2, 3) , (4)
1
2
3
4

Abstract

We present new theoretical results on sparse recovery guarantees for a greedy algorithm, orthogonal matching pursuit (OMP), in the context of continuous parametric dictionaries, i.e., made up of an infinite uncountable number of atoms. We build up a family of dictionaries for which k-step recovery is possible.
Fichier principal
Vignette du fichier
spars.pdf (211.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02157561 , version 1 (17-06-2019)

Identifiers

  • HAL Id : hal-02157561 , version 1

Cite

Clément Elvira, Rémi Gribonval, Cédric Herzet, Charles Soussen. Uniform k-step recovery with CMF dictionaries. SPARS 2019 - Signal Processing with Adaptive Sparse Structured Representations, Jul 2019, Toulouse, France. pp.1-2. ⟨hal-02157561⟩
150 View
214 Download

Share

Gmail Facebook Twitter LinkedIn More