Sciweavers

441 search results - page 2 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 6 months ago
Sparsity in time-frequency representations
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
Götz E. Pfander, Holger Rauhut
CISS
2011
IEEE
12 years 10 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...
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
13 years 9 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
TIT
2010
174views Education» more  TIT 2010»
13 years 23 days ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
FOCM
2008
156views more  FOCM 2008»
13 years 6 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut