BERTHOUMIEU, Yannick; DOSSAL, Charles; PUSTELNIK, Nelly; RICOUX, Philippe; TURCU, Flavius

doi:10.1007/s10851-013-0453-4

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

BERTHOUMIEU, Yannick
Laboratoire de l'intégration, du matériau au système [IMS]

DOSSAL, Charles
Institut de Mathématiques de Bordeaux [IMB]

PUSTELNIK, Nelly
Laboratoire de Physique de l'ENS Lyon [Phys-ENS]

Langue

Article de revue

Ce document a été publié dans

Journal of Mathematical Imaging and Vision. 2013-08-01

Springer Verlag

Résumé en anglais

The paper deals with the estimation of the maximal sparsity degree for which a given measurement matrix allows sparse reconstruction through l1-minimization. This problem is a key issue in different applications featuring particular types of measurement matrices, as for instance in the framework of tomography with low number of views. In this framework, while the exact bound is NP hard to compute, most classical criteria guarantee lower bounds that are numerically too pessimistic. In order to achieve an accurate estimation, we propose an efficient greedy algorithm that provides an upper bound for this maximal sparsity. Based on polytope theory, the algorithm consists in finding sparse vectors that cannot be recovered by l1-minimization. Moreover, in order to deal with noisy measurements, theoretical conditions leading to a more restrictive but reasonable bounds are investigated. Numerical results are presented for discrete versions of tomo\-graphy measurement matrices, which are stacked Radon transforms corresponding to different tomograph views.< Réduire

Mots clés en anglais

Compressed sensing

Deterministic matrix

Sparsity degree

Greedy algorithm

Métadonnées

Partager cette publication !

Licence d’utilisation du document

An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche