NDLI: OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints

Content Provider	IEEE Xplore Digital Library
Author	Wimalajeewa, T. Varshney, P.K.
Copyright Year	1991
Abstract	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.
Sponsorship	IEEE Signal Processing Society
Starting Page	5059
Ending Page	5072
Page Count	14
File Size	2922147
File Format	PDF
ISSN	1053587X
Volume Number	62
Issue Number	19
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Matching pursuit algorithms Joints Sensors Sparse matrices Signal processing algorithms Bandwidth decentralized algorithms Multiple measurement vectors (MMVs) sparsity pattern recovery compressive sensing orthogonal matching pursuit (OMP)
Content Type	Text
Resource Type	Article
Subject	Signal Processing Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Decentralized and Collaborative Subspace Pursuit: A Communication-Efficient Algorithm for Joint Sparsity Pattern Recovery With Sensor Networks

On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit

Rank Awareness in Joint Sparse Recovery

Greedy Algorithms for Joint Sparse Recovery

Orthogonal Matching Pursuit: A Brownian Motion Analysis

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

Generalized Orthogonal Matching Pursuit

Structure-Based Bayesian Sparse Reconstruction

Recovery Guarantees for Rank Aware Pursuits

OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints

Similar Documents

Decentralized and Collaborative Subspace Pursuit: A Communication-Efficient Algorithm for Joint Sparsity Pattern Recovery With Sensor Networks

On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit

Rank Awareness in Joint Sparse Recovery

Greedy Algorithms for Joint Sparse Recovery

Orthogonal Matching Pursuit: A Brownian Motion Analysis

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

Generalized Orthogonal Matching Pursuit

Structure-Based Bayesian Sparse Reconstruction

Recovery Guarantees for Rank Aware Pursuits

OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints