Challenging Restricted Isometry Constants with Greedy Pursuit
Idioma
en
Communication dans un congrès
Este ítem está publicado en
Proc. of IEEE Information Theory Workshop 2009, Proc. of IEEE Information Theory Workshop 2009, ITW'09, 2009-10-11, Taormina. 2009-10-11p. 475-479
IEEE
Resumen en inglés
This paper proposes greedy numerical schemes to compute lower bounds of the restricted isometry constants that are central in compressed sensing theory. Matrices with small restricted isometry constants enable stable ...Leer más >
Palabras clave en inglés
Compressed sensing
compressive sampling
random matrices
restricted isometry constants
sparsity