Using compression codes in compressed sensing

Farideh Ebrahim Rezagah, Shirin Jalali, Elza Erkip, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Data compression and compressed sensing algorithms exploit the structure present in a signal for its efficient representation and measurement, respectively. While most state-of-the-art data compression codes take advantage of complex patterns present in signals of interest, this is not the case in compressed sensing. This paper explores usage of efficient data compression codes in building compressed sensing recovery methods for stochastic processes. It is proved that for an i.i.d. process, compression-based compressed sensing achieves the fundamental limits in terms of the number of measurements. It is also proved that compressed sensing recovery methods built based on a family of universal compression codes yield a family of universal compressed sensing schemes.

Original languageEnglish (US)
Title of host publication2016 IEEE Information Theory Workshop, ITW 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages444-448
Number of pages5
ISBN (Electronic)9781509010905
DOIs
StatePublished - Oct 21 2016
Event2016 IEEE Information Theory Workshop, ITW 2016 - Cambridge, United Kingdom
Duration: Sep 11 2016Sep 14 2016

Other

Other2016 IEEE Information Theory Workshop, ITW 2016
CountryUnited Kingdom
CityCambridge
Period9/11/169/14/16

Fingerprint

Compressed sensing
Data compression
Recovery
Random processes

Keywords

  • Compressed Sensing
  • Information dimension
  • Lossy Compression
  • Rate distortion dimension
  • Universal coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Software
  • Signal Processing

Cite this

Rezagah, F. E., Jalali, S., Erkip, E., & Poor, H. V. (2016). Using compression codes in compressed sensing. In 2016 IEEE Information Theory Workshop, ITW 2016 (pp. 444-448). [7606873] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2016.7606873

Using compression codes in compressed sensing. / Rezagah, Farideh Ebrahim; Jalali, Shirin; Erkip, Elza; Poor, H. Vincent.

2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 444-448 7606873.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rezagah, FE, Jalali, S, Erkip, E & Poor, HV 2016, Using compression codes in compressed sensing. in 2016 IEEE Information Theory Workshop, ITW 2016., 7606873, Institute of Electrical and Electronics Engineers Inc., pp. 444-448, 2016 IEEE Information Theory Workshop, ITW 2016, Cambridge, United Kingdom, 9/11/16. https://doi.org/10.1109/ITW.2016.7606873
Rezagah FE, Jalali S, Erkip E, Poor HV. Using compression codes in compressed sensing. In 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 444-448. 7606873 https://doi.org/10.1109/ITW.2016.7606873
Rezagah, Farideh Ebrahim ; Jalali, Shirin ; Erkip, Elza ; Poor, H. Vincent. / Using compression codes in compressed sensing. 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 444-448
@inproceedings{2ec9e4b536c94f188ce1bafade7973d1,
title = "Using compression codes in compressed sensing",
abstract = "Data compression and compressed sensing algorithms exploit the structure present in a signal for its efficient representation and measurement, respectively. While most state-of-the-art data compression codes take advantage of complex patterns present in signals of interest, this is not the case in compressed sensing. This paper explores usage of efficient data compression codes in building compressed sensing recovery methods for stochastic processes. It is proved that for an i.i.d. process, compression-based compressed sensing achieves the fundamental limits in terms of the number of measurements. It is also proved that compressed sensing recovery methods built based on a family of universal compression codes yield a family of universal compressed sensing schemes.",
keywords = "Compressed Sensing, Information dimension, Lossy Compression, Rate distortion dimension, Universal coding",
author = "Rezagah, {Farideh Ebrahim} and Shirin Jalali and Elza Erkip and Poor, {H. Vincent}",
year = "2016",
month = "10",
day = "21",
doi = "10.1109/ITW.2016.7606873",
language = "English (US)",
pages = "444--448",
booktitle = "2016 IEEE Information Theory Workshop, ITW 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Using compression codes in compressed sensing

AU - Rezagah, Farideh Ebrahim

AU - Jalali, Shirin

AU - Erkip, Elza

AU - Poor, H. Vincent

PY - 2016/10/21

Y1 - 2016/10/21

N2 - Data compression and compressed sensing algorithms exploit the structure present in a signal for its efficient representation and measurement, respectively. While most state-of-the-art data compression codes take advantage of complex patterns present in signals of interest, this is not the case in compressed sensing. This paper explores usage of efficient data compression codes in building compressed sensing recovery methods for stochastic processes. It is proved that for an i.i.d. process, compression-based compressed sensing achieves the fundamental limits in terms of the number of measurements. It is also proved that compressed sensing recovery methods built based on a family of universal compression codes yield a family of universal compressed sensing schemes.

AB - Data compression and compressed sensing algorithms exploit the structure present in a signal for its efficient representation and measurement, respectively. While most state-of-the-art data compression codes take advantage of complex patterns present in signals of interest, this is not the case in compressed sensing. This paper explores usage of efficient data compression codes in building compressed sensing recovery methods for stochastic processes. It is proved that for an i.i.d. process, compression-based compressed sensing achieves the fundamental limits in terms of the number of measurements. It is also proved that compressed sensing recovery methods built based on a family of universal compression codes yield a family of universal compressed sensing schemes.

KW - Compressed Sensing

KW - Information dimension

KW - Lossy Compression

KW - Rate distortion dimension

KW - Universal coding

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

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

U2 - 10.1109/ITW.2016.7606873

DO - 10.1109/ITW.2016.7606873

M3 - Conference contribution

AN - SCOPUS:84998655271

SP - 444

EP - 448

BT - 2016 IEEE Information Theory Workshop, ITW 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -