A Numerical Exploration of Compressed Sampling Recovery - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A Numerical Exploration of Compressed Sampling Recovery

Résumé

This paper explores numerically the efficiency of $\lun$ minimization for the recovery of sparse signals from compressed sampling measurements in the noiseless case. Inspired by topological criteria for $\lun$-identifiability, a greedy algorithm computes sparse vectors that are difficult to recover by $\ell_1$-minimization. We evaluate numerically the theoretical analysis without resorting to Monte-Carlo sampling, which tends to avoid worst case scenarios. This allows one to challenge sparse recovery conditions based on polytope projection and on the restricted isometry property.
Fichier principal
Vignette du fichier
DossalPeyreFadili-SPARS09.pdf (143.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00365028 , version 1 (02-03-2009)

Identifiants

  • HAL Id : hal-00365028 , version 1

Citer

Charles H Dossal, Gabriel Peyré, Jalal M. Fadili. A Numerical Exploration of Compressed Sampling Recovery. SPARS'09, Signal Processing with Adaptive Sparse Structured Representations, Apr 2009, Saint-Malo, France. 5p. ⟨hal-00365028⟩
413 Consultations
182 Téléchargements

Partager

Gmail Facebook X LinkedIn More