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

doi:10.1007/s10851-013-0453-4

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

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]

Idioma

Article de revue

Este ítem está publicado en

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

Springer Verlag

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

Compressed sensing

Deterministic matrix

Sparsity degree

Greedy algorithm

Metadatos

Compartir este ítem

Licencia de uso del documento

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

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

DOI

Orígen

Centros de investigación