11 search results - page 2 / 3 » Deterministic constructions of compressed sensing matrices |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
The aim of compressed sensing is to recover attributes of sparse signals using very few measurements. Given an overall bit budget for quantization, this paper demonstrates that th...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Recently, the statistical restricted isometry property (RIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this paper...
TIT
2010
12 years 12 months ago
2010
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
CORR
2010
Springer
13 years 7 days ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...