Low-complexity iterative reconstruction algorithms in compressed sensing

Ludovic Danjean, Bane V Vasic, Michael W Marcellin, David Declercq

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

Abstract

In this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the otherreconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.

Original languageEnglish (US)
Title of host publicationProceedings of the International Telemetering Conference
Volume49
StatePublished - 2013
EventITC/USA 2013: 49th Annual International Telemetering Conference and Technical Exhibition - Meeting all the Challenges of Telemetry, 2013 - Las Vegas,NV, United States
Duration: Oct 21 2013Oct 24 2013

Other

OtherITC/USA 2013: 49th Annual International Telemetering Conference and Technical Exhibition - Meeting all the Challenges of Telemetry, 2013
CountryUnited States
CityLas Vegas,NV
Period10/21/1310/24/13

Fingerprint

Compressed sensing
Message passing
messages
matrices
proportion
intervals

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Instrumentation
  • Computer Networks and Communications
  • Signal Processing

Cite this

Danjean, L., Vasic, B. V., Marcellin, M. W., & Declercq, D. (2013). Low-complexity iterative reconstruction algorithms in compressed sensing. In Proceedings of the International Telemetering Conference (Vol. 49)

Low-complexity iterative reconstruction algorithms in compressed sensing. / Danjean, Ludovic; Vasic, Bane V; Marcellin, Michael W; Declercq, David.

Proceedings of the International Telemetering Conference. Vol. 49 2013.

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

Danjean, L, Vasic, BV, Marcellin, MW & Declercq, D 2013, Low-complexity iterative reconstruction algorithms in compressed sensing. in Proceedings of the International Telemetering Conference. vol. 49, ITC/USA 2013: 49th Annual International Telemetering Conference and Technical Exhibition - Meeting all the Challenges of Telemetry, 2013, Las Vegas,NV, United States, 10/21/13.
Danjean L, Vasic BV, Marcellin MW, Declercq D. Low-complexity iterative reconstruction algorithms in compressed sensing. In Proceedings of the International Telemetering Conference. Vol. 49. 2013
Danjean, Ludovic ; Vasic, Bane V ; Marcellin, Michael W ; Declercq, David. / Low-complexity iterative reconstruction algorithms in compressed sensing. Proceedings of the International Telemetering Conference. Vol. 49 2013.
@inproceedings{8236849b1ee14feaaea586052c7e9f59,
title = "Low-complexity iterative reconstruction algorithms in compressed sensing",
abstract = "In this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the otherreconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.",
author = "Ludovic Danjean and Vasic, {Bane V} and Marcellin, {Michael W} and David Declercq",
year = "2013",
language = "English (US)",
volume = "49",
booktitle = "Proceedings of the International Telemetering Conference",

}

TY - GEN

T1 - Low-complexity iterative reconstruction algorithms in compressed sensing

AU - Danjean, Ludovic

AU - Vasic, Bane V

AU - Marcellin, Michael W

AU - Declercq, David

PY - 2013

Y1 - 2013

N2 - In this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the otherreconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.

AB - In this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the otherreconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.

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

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

M3 - Conference contribution

VL - 49

BT - Proceedings of the International Telemetering Conference

ER -