Sciweavers

23 search results - page 4 / 5
» Compressed Sensing: How sharp is the Restricted Isometry Pro...
Sort
View
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 4 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
ICASSP
2011
IEEE
12 years 9 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher
ICASSP
2011
IEEE
12 years 9 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan
FOCM
2011
175views more  FOCM 2011»
13 years 22 days ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma