Sciweavers

10 search results - page 1 / 2
» Nonuniform Sparse Recovery with Gaussian Matrices
Sort
View
74
Voted
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 9 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 9 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran
99
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Weighted compressed sensing and rank minimization
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
CISS
2011
IEEE
14 years 1 months ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...
SIAMJO
2011
14 years 4 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan