Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Nelly Pustelnik Connect in order to contact the contributor
Submitted on : Wednesday, October 30, 2013 - 1:25:34 PM
Last modification on : Tuesday, October 19, 2021 - 11:05:46 PM
Long-term archiving on: : Friday, January 31, 2014 - 9:25:34 AM


Files produced by the author(s)



Yannick Berthoumieu, Charles Dossal, Nelly Pustelnik, Philippe Ricoux, Flavius Turcu. An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices. Journal of Mathematical Imaging and Vision, Springer Verlag, 2013, ⟨10.1007/s10851-013-0453-4⟩. ⟨hal-00878620⟩



Record views


Files downloads