Uniform k-step recovery with CMF dictionaries
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...