A greedy algorithm to extract sparsity degree for l1/l0-equivalence in a deterministic context - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A greedy algorithm to extract sparsity degree for l1/l0-equivalence in a deterministic context

Nelly Pustelnik
Charles H Dossal
  • Fonction : Auteur
  • PersonId : 1069990
Philippe Ricoux
  • Fonction : Auteur
  • PersonId : 938361

Résumé

This paper investigates the problem of designing a deterministic system matrix, that is measurement matrix, for sparse recovery. An efficient greedy algorithm is proposed in order to extract the class of sparse signal/image which cannot be reconstructed by $\ell_1$-minimization for a fixed system matrix. Based on the polytope theory, the algorithm provides a geometric interpretation of the recovery condition considering the seminal work by Donoho. The paper presents an additional condition, extending the Fuchs/Tropp results, in order to deal with noisy measurements. Simulations are conducted for tomography-like imaging system in which the design of the system matrix is a difficult task consisting of the selection of the number of views according to the sparsity degree.
Fichier principal
Vignette du fichier
HAL.pdf (153.59 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00826828 , version 1 (28-05-2013)

Identifiants

  • HAL Id : hal-00826828 , version 1

Citer

Nelly Pustelnik, Charles H Dossal, Flavius Turcu, Yannick Berthoumieu, Philippe Ricoux. A greedy algorithm to extract sparsity degree for l1/l0-equivalence in a deterministic context. European Signal Processing Conference (EUSIPCO), Aug 2012, Bucharest, Romania. pp.x+5. ⟨hal-00826828⟩
303 Consultations
85 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More