On iterative compressed sensing reconstruction of sparse non-negative vectors

Vida Ravanmehr, Ludovic Danjean, David Declercq, Bane V Vasic

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

Abstract

We consider the iterative reconstruction of the Compressed Sensing (CS) problem over reals. The iterative reconstruction allows interpretation as a channel-coding problem, and it guarantees perfect reconstruction for properly chosen measurement matrices and sufficiently sparse error vectors. In this paper, we give a summary on reconstruction algorithms for compressed sensing and examine how the iterative reconstruction performs on quasi-cyclic low-density parity check (QC-LDPC) measurement matrices.

Original languageEnglish (US)
Title of host publicationACM International Conference Proceeding Series
DOIs
StatePublished - 2011
Event4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, ISABEL'11 - Barcelona, Spain
Duration: Oct 26 2011Oct 29 2011

Other

Other4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, ISABEL'11
CountrySpain
CityBarcelona
Period10/26/1110/29/11

Fingerprint

Compressed sensing
Channel coding

Keywords

  • bipartite graphs
  • compressed sensing
  • low-density parity check codes
  • message-passing algorithm

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Ravanmehr, V., Danjean, L., Declercq, D., & Vasic, B. V. (2011). On iterative compressed sensing reconstruction of sparse non-negative vectors. In ACM International Conference Proceeding Series https://doi.org/10.1145/2093698.2093844

On iterative compressed sensing reconstruction of sparse non-negative vectors. / Ravanmehr, Vida; Danjean, Ludovic; Declercq, David; Vasic, Bane V.

ACM International Conference Proceeding Series. 2011.

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

Ravanmehr, V, Danjean, L, Declercq, D & Vasic, BV 2011, On iterative compressed sensing reconstruction of sparse non-negative vectors. in ACM International Conference Proceeding Series. 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, ISABEL'11, Barcelona, Spain, 10/26/11. https://doi.org/10.1145/2093698.2093844
Ravanmehr V, Danjean L, Declercq D, Vasic BV. On iterative compressed sensing reconstruction of sparse non-negative vectors. In ACM International Conference Proceeding Series. 2011 https://doi.org/10.1145/2093698.2093844
Ravanmehr, Vida ; Danjean, Ludovic ; Declercq, David ; Vasic, Bane V. / On iterative compressed sensing reconstruction of sparse non-negative vectors. ACM International Conference Proceeding Series. 2011.
@inproceedings{48917333f06741f38e4bb70d94925c0b,
title = "On iterative compressed sensing reconstruction of sparse non-negative vectors",
abstract = "We consider the iterative reconstruction of the Compressed Sensing (CS) problem over reals. The iterative reconstruction allows interpretation as a channel-coding problem, and it guarantees perfect reconstruction for properly chosen measurement matrices and sufficiently sparse error vectors. In this paper, we give a summary on reconstruction algorithms for compressed sensing and examine how the iterative reconstruction performs on quasi-cyclic low-density parity check (QC-LDPC) measurement matrices.",
keywords = "bipartite graphs, compressed sensing, low-density parity check codes, message-passing algorithm",
author = "Vida Ravanmehr and Ludovic Danjean and David Declercq and Vasic, {Bane V}",
year = "2011",
doi = "10.1145/2093698.2093844",
language = "English (US)",
isbn = "9781450309134",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - On iterative compressed sensing reconstruction of sparse non-negative vectors

AU - Ravanmehr, Vida

AU - Danjean, Ludovic

AU - Declercq, David

AU - Vasic, Bane V

PY - 2011

Y1 - 2011

N2 - We consider the iterative reconstruction of the Compressed Sensing (CS) problem over reals. The iterative reconstruction allows interpretation as a channel-coding problem, and it guarantees perfect reconstruction for properly chosen measurement matrices and sufficiently sparse error vectors. In this paper, we give a summary on reconstruction algorithms for compressed sensing and examine how the iterative reconstruction performs on quasi-cyclic low-density parity check (QC-LDPC) measurement matrices.

AB - We consider the iterative reconstruction of the Compressed Sensing (CS) problem over reals. The iterative reconstruction allows interpretation as a channel-coding problem, and it guarantees perfect reconstruction for properly chosen measurement matrices and sufficiently sparse error vectors. In this paper, we give a summary on reconstruction algorithms for compressed sensing and examine how the iterative reconstruction performs on quasi-cyclic low-density parity check (QC-LDPC) measurement matrices.

KW - bipartite graphs

KW - compressed sensing

KW - low-density parity check codes

KW - message-passing algorithm

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

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

U2 - 10.1145/2093698.2093844

DO - 10.1145/2093698.2093844

M3 - Conference contribution

AN - SCOPUS:84856763488

SN - 9781450309134

BT - ACM International Conference Proceeding Series

ER -