Texas hold 'em algorithms for distributed compressive sensing

Stephen R. Schnelle; Jason N. Laska; Chinmay Hegde; Marco F. Duarte; Mark A. Davenport; Richard G. Baraniuk

doi:10.1109/ICASSP.2010.5496168

Texas hold 'em algorithms for distributed compressive sensing

Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde, Marco F. Duarte, Mark A. Davenport, Richard G. Baraniuk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

19 Scopus citations

Abstract

This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlations through the concept of joint sparsity to further reduce the number of measurements required for recovery. DCS is well-suited for sensor network applications due to its universality, computational asymmetry, tolerance to quantization and noise, and robustness to measurement loss. In this paper we propose recovery algorithms for the sparse common and innovation joint sparsity model. Our approach leads to a class of efficient algorithms, the Texas Hold 'Em algorithms, which are scalable both in terms of communication bandwidth and computational complexity.

Original language	English (US)
Title of host publication	2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings
Pages	2886-2889
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.2010.5496168
State	Published - Nov 8 2010
Event	2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States Duration: Mar 14 2010 → Mar 19 2010

Other

Other	2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
Country	United States
City	Dallas, TX
Period	3/14/10 → 3/19/10

Keywords

Data compression
Multisensor systems
Signal reconstruction

ASJC Scopus subject areas

Signal Processing
Software
Electrical and Electronic Engineering

Access to Document

10.1109/ICASSP.2010.5496168

Fingerprint Dive into the research topics of 'Texas hold 'em algorithms for distributed compressive sensing'. Together they form a unique fingerprint.

Cite this

Texas hold 'em algorithms for distributed compressive sensing. / Schnelle, Stephen R.; Laska, Jason N.; Hegde, Chinmay; Duarte, Marco F.; Davenport, Mark A.; Baraniuk, Richard G.

2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings. 2010. p. 2886-2889 5496168.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Schnelle, SR, Laska, JN, Hegde, C, Duarte, MF, Davenport, MA & Baraniuk, RG 2010, Texas hold 'em algorithms for distributed compressive sensing. in 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings., 5496168, pp. 2886-2889, 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010, Dallas, TX, United States, 3/14/10. https://doi.org/10.1109/ICASSP.2010.5496168

@inproceedings{2a2b17b8325c43a688e52633594c5717,

title = "Texas hold 'em algorithms for distributed compressive sensing",

abstract = "This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlations through the concept of joint sparsity to further reduce the number of measurements required for recovery. DCS is well-suited for sensor network applications due to its universality, computational asymmetry, tolerance to quantization and noise, and robustness to measurement loss. In this paper we propose recovery algorithms for the sparse common and innovation joint sparsity model. Our approach leads to a class of efficient algorithms, the Texas Hold 'Em algorithms, which are scalable both in terms of communication bandwidth and computational complexity.",

keywords = "Data compression, Multisensor systems, Signal reconstruction",

author = "Schnelle, {Stephen R.} and Laska, {Jason N.} and Chinmay Hegde and Duarte, {Marco F.} and Davenport, {Mark A.} and Baraniuk, {Richard G.}",

year = "2010",

month = nov,

day = "8",

doi = "10.1109/ICASSP.2010.5496168",

language = "English (US)",

isbn = "9781424442966",

pages = "2886--2889",

booktitle = "2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings",

note = "2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 ; Conference date: 14-03-2010 Through 19-03-2010",

}

TY - GEN

T1 - Texas hold 'em algorithms for distributed compressive sensing

AU - Schnelle, Stephen R.

AU - Laska, Jason N.

AU - Hegde, Chinmay

AU - Duarte, Marco F.

AU - Davenport, Mark A.

AU - Baraniuk, Richard G.

PY - 2010/11/8

Y1 - 2010/11/8

N2 - This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlations through the concept of joint sparsity to further reduce the number of measurements required for recovery. DCS is well-suited for sensor network applications due to its universality, computational asymmetry, tolerance to quantization and noise, and robustness to measurement loss. In this paper we propose recovery algorithms for the sparse common and innovation joint sparsity model. Our approach leads to a class of efficient algorithms, the Texas Hold 'Em algorithms, which are scalable both in terms of communication bandwidth and computational complexity.

AB - This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlations through the concept of joint sparsity to further reduce the number of measurements required for recovery. DCS is well-suited for sensor network applications due to its universality, computational asymmetry, tolerance to quantization and noise, and robustness to measurement loss. In this paper we propose recovery algorithms for the sparse common and innovation joint sparsity model. Our approach leads to a class of efficient algorithms, the Texas Hold 'Em algorithms, which are scalable both in terms of communication bandwidth and computational complexity.

KW - Data compression

KW - Multisensor systems

KW - Signal reconstruction

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

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

U2 - 10.1109/ICASSP.2010.5496168

DO - 10.1109/ICASSP.2010.5496168

M3 - Conference contribution

AN - SCOPUS:78049390984

SN - 9781424442966

SP - 2886

EP - 2889

BT - 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings

T2 - 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010

Y2 - 14 March 2010 through 19 March 2010

ER -