441 search results - page 20 / 89 » Sparse Recovery Using Sparse Random Matrices |
ISBI
2011
IEEE
14 years 1 months ago
2011
IEEE
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
150
click to vote
SIAMIS
2011
14 years 4 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
110
click to vote
JMLR
2012
13 years 8 days ago
2012
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...