Published April 2008
| Published
Book Section - Chapter
Open
Explicit measurements with almost optimal thresholds for compressed sensing
- Creators
- Parvaresh, Farzad
-
Hassibi, Babak
Abstract
We consider the deterministic construction of a measurement matrix and a recovery method for signals that are block sparse. A signal that has dimension N = nd, which consists of n blocks of size d, is called (s, d)-block sparse if only s blocks out of n are nonzero. We construct an explicit linear mapping Φ that maps the (s, d)-block sparse signal to a measurement vector of dimension M, where s•d
Additional Information
© 2008 IEEE. This work was supported in parts by the National Science Foundation under grants no. CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech's Lee Center for Advanced Networking.Attached Files
Files
Parvaresh2008p87442009_Ieee_International_Conference_On_Acoustics_Speech_And_Signal_Processing_Vols_1-_8_Proceedings.pdf
Files
(185.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:ac9ad55b4b52af7affaa087f597ce677
|
185.8 kB | Preview Download |
Additional details
- Eprint ID
- 19150
- Resolver ID
- CaltechAUTHORS:20100721-154038572
- CCR-0133818
- NSF
- CCR-0326554
- NSF
- David and Lucille Packard Foundation
- Caltech Lee Center for Advanced Networking
- Created
-
2010-07-30Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Series Name
- International Conference on Acoustics Speech and Signal Processing (ICASSP)