Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

Swatantra Kafle, Vipul Gupta, Bhavya Kailkhura, Thakshila Wimalajeewa, Pramod Kumar Varshney

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l 1,∞ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. We further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

Original languageEnglish (US)
Article number8360527
Pages (from-to)15-30
Number of pages16
JournalIEEE Transactions on Signal and Information Processing over Networks
Volume5
Issue number1
DOIs
StatePublished - Mar 1 2019

Fingerprint

Sensor networks
Recovery
Fusion reactions
Cost functions
Maximum likelihood
Signal to noise ratio
Sensors

Keywords

  • binary iterative hard thresholding
  • common sparsity pattern recovery
  • Compressive sensing
  • distributed sensor networks
  • quantization

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Computer Networks and Communications

Cite this

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks. / Kafle, Swatantra; Gupta, Vipul; Kailkhura, Bhavya; Wimalajeewa, Thakshila; Varshney, Pramod Kumar.

In: IEEE Transactions on Signal and Information Processing over Networks, Vol. 5, No. 1, 8360527, 01.03.2019, p. 15-30.

Research output: Contribution to journalArticle

@article{0d261a17390d424db871c63d6740abe9,
title = "Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks",
abstract = "In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l 1,∞ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. We further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.",
keywords = "binary iterative hard thresholding, common sparsity pattern recovery, Compressive sensing, distributed sensor networks, quantization",
author = "Swatantra Kafle and Vipul Gupta and Bhavya Kailkhura and Thakshila Wimalajeewa and Varshney, {Pramod Kumar}",
year = "2019",
month = "3",
day = "1",
doi = "10.1109/TSIPN.2018.2838038",
language = "English (US)",
volume = "5",
pages = "15--30",
journal = "IEEE Transactions on Signal and Information Processing over Networks",
issn = "2373-776X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

AU - Kafle, Swatantra

AU - Gupta, Vipul

AU - Kailkhura, Bhavya

AU - Wimalajeewa, Thakshila

AU - Varshney, Pramod Kumar

PY - 2019/3/1

Y1 - 2019/3/1

N2 - In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l 1,∞ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. We further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

AB - In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l 1,∞ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. We further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

KW - binary iterative hard thresholding

KW - common sparsity pattern recovery

KW - Compressive sensing

KW - distributed sensor networks

KW - quantization

UR - http://www.scopus.com/inward/record.url?scp=85061761423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061761423&partnerID=8YFLogxK

U2 - 10.1109/TSIPN.2018.2838038

DO - 10.1109/TSIPN.2018.2838038

M3 - Article

AN - SCOPUS:85061761423

VL - 5

SP - 15

EP - 30

JO - IEEE Transactions on Signal and Information Processing over Networks

JF - IEEE Transactions on Signal and Information Processing over Networks

SN - 2373-776X

IS - 1

M1 - 8360527

ER -