OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints

We address the problem of joint sparsity pattern recovery based on multiple measurement vectors (MMVs) in resource constrained distributed networks. We assume that distributed nodes observe sparse signals that share a common (but unknown) sparsity pattern. Each node is assumed to sample the sparse s...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2014-10, Vol.62 (19), p.5059-5072
Main Authors: Wimalajeewa, Thakshila, Varshney, Pramod K.
Format: Article
Language:English
Subjects:
Algorithms
Bandwidth
Channels
compressive sensing
decentralized algorithms
Economic conditions
Estimating
Joints
Matching pursuit algorithms
Mathematical analysis
Multiple measurement vectors (MMVs)
orthogonal matching pursuit (OMP)
Recovery
Sensors
Signal processing algorithms
Sparse matrices
Sparsity
sparsity pattern recovery
Vectors
Vectors (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We address the problem of joint sparsity pattern recovery based on multiple measurement vectors (MMVs) in resource constrained distributed networks. We assume that distributed nodes observe sparse signals that share a common (but unknown) sparsity pattern. Each node is assumed to sample the sparse signals via different sensing matrices in general. In many distributed communication networks, it is often required that joint sparse recovery be performed under inherent resource constraints such as communication bandwidth and transmit/processing power. We propose two approaches to take the communication constraints into account while performing joint sparsity pattern recovery. First, we explore the use of a shared multiple access channel (MAC) in forwarding observation vectors from each node to a fusion center. With MAC, while the bandwidth requirement does not depend on the number of nodes, the fusion center has access to only linear combinations of the observations. We discuss the conditions under which the common sparsity pattern can be recovered reliably. Second, we develop two efficient collaborative algorithms based on orthogonal matching pursuit (OMP), to jointly estimate the common sparsity pattern in a decentralized manner with a low communication overhead. In the proposed algorithms, each node collaborates with neighboring nodes by sharing a small amount of information at different stages while estimating the indices of the true sparsity pattern in a greedy manner. The tradeoff between the performance gain and the communication overhead of the proposed algorithms is demonstrated via simulations.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2014.2343947