Abstract
We study the problem of joint sparsity pattern recovery with 1-bit compressive measurements in a sensor network. Sensors are assumed to observe sparse signals having the same but unknown sparsity pattern. Each sensor quantizes its measurement vector element-wise to 1-bit and transmits the quantized observations to a fusion center. We develop a computationally tractable support recovery algorithm which minimizes a cost function defined in terms of the likelihood function and the ℓ1,∞ norm. We observe that even with noisy 1-bit measurements, joint sparsity pattern can be recovered accurately with multiple sensors each collecting only a small number of measurements.
Original language | English (US) |
---|---|
Title of host publication | Conference Record - Asilomar Conference on Signals, Systems and Computers |
Publisher | IEEE Computer Society |
Pages | 1472-1476 |
Number of pages | 5 |
Volume | 2016-February |
ISBN (Print) | 9781467385763 |
DOIs | |
State | Published - Feb 26 2016 |
Event | 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 8 2015 → Nov 11 2015 |
Other
Other | 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 |
---|---|
Country/Territory | United States |
City | Pacific Grove |
Period | 11/8/15 → 11/11/15 |
Keywords
- Compressed sensing
- maximum-likelihood estimation
- quantization
- support recovery
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing