Bayesian online compressed sensing

Paulo V. Rossi, Yoshiyuki Kabashima, and Jun-ichi Inoue
Phys. Rev. E 94, 022137 – Published 29 August 2016

Abstract

In this paper, we explore the possibilities and limitations of recovering sparse signals in an online fashion. Employing a mean field approximation to the Bayes recursion formula yields an online signal recovery algorithm that can be performed with a computational cost that is linearly proportional to the signal length per update. Analysis of the resulting algorithm indicates that the online algorithm asymptotically saturates the optimal performance limit achieved by the offline method in the presence of Gaussian measurement noise, while differences in the allowable computational costs may result in fundamental gaps of the achievable performance in the absence of noise.

  • Figure
  • Figure
  • Figure
  • Received 7 August 2015

DOI:https://doi.org/10.1103/PhysRevE.94.022137

©2016 American Physical Society

Physics Subject Headings (PhySH)

Nonlinear Dynamics

Authors & Affiliations

Paulo V. Rossi

  • Departamento de Física Geral, Instituto de Física, University of São Paulo, CP 66318, São Paulo, SP 05314-970, Brazil

Yoshiyuki Kabashima

  • Department of Mathematical and Computing Science, Tokyo Institute of Technology, Yokohama 226-8502, Japan

Jun-ichi Inoue

  • Graduate School of Information Science and Technology, Hokkaido University, N14-W9, Kita-ku, Sapporo 060-0814, Japan

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 94, Iss. 2 — August 2016

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Abbrechen
×

Suche


Article Lookup

Paste a citation or DOI

Enter a citation
×