On the Theorem of Uniform Recovery of Random Sampling Matrices

DOI10.1109/TIT.2014.2300092zbMath1360.94181arXiv1206.5986OpenAlexW1989685136MaRDI QIDQ2986492

Jan-Olov Strömberg, Joel A. E. Andersson

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.5986

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items

A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Unnamed Item ⋮ Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information ⋮ A null-space-based weightedl₁minimization approach to compressed sensing ⋮ On the sparsity of Lasso minimizers in sparse data recovery ⋮ Stability analysis of a class of sparse optimization problems ⋮ Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels