English
Related papers

Related papers: Bernoulli-Gaussian Approximate Message-Passing Alg…

200 papers

Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information about the signal, or \emph{side information} (SI), is commonly available and can aid in efficient signal recovery. This…

Information Theory · Computer Science 2019-05-06 Anna Ma , You , Zhou , Cynthia Rush , Dror Baron , Deanna Needell

Low-cost message passing (MP) algorithm has been recognized as a promising technique for sparse vector recovery. However, the existing MP algorithms either focus on mean square error (MSE) of the value recovery while ignoring the sparsity…

Information Theory · Computer Science 2017-08-01 Lei Liu , Chongwen Huang , Yuhao Chi , Chau Yuen , Yong Liang Guan , Ying Li

In this paper, an efficient distributed approach for implementing the approximate message passing (AMP) algorithm, named distributed AMP (DAMP), is developed for compressed sensing (CS) recovery in sensor networks with the sparsity K…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-26 Puxiao Han , Ruixin Niu , Mengqi Ren

Bayesian approximate message passing (BAMP) is an efficient method in compressed sensing that is nearly optimal in the minimum mean squared error (MMSE) sense. Bayesian approximate message passing (BAMP) performs joint recovery of multiple…

Information Theory · Computer Science 2019-01-30 Gabor Hannak , Alessandro Perelli , Norbert Goertz , Gerald Matz , Mike E. Davies

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2016-11-03 Yanting Ma , Junan Zhu , Dror Baron

In phase retrieval, the goal is to recover a signal $\mathbf{x}\in\mathbb{C}^N$ from the magnitudes of linear measurements $\mathbf{Ax}\in\mathbb{C}^M$. While recent theory has established that $M\approx 4N$ intensity measurements are…

Information Theory · Computer Science 2015-06-19 Philip Schniter , Sundeep Rangan

High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by…

Information Theory · Computer Science 2022-03-02 Qiuyun Zou , Hongwen Yang

1-bit compressive sensing aims to recover sparse signals from quantized 1-bit measurements. Designing efficient approaches that could handle noisy 1-bit measurements is important in a variety of applications. In this paper we use the…

Information Theory · Computer Science 2022-04-28 Shuai Huang , Trac D. Tran

The generalized approximate message passing (GAMP) algorithm under the Bayesian setting shows advantage in recovering under-sampled sparse signals from corrupted observations. Compared to conventional convex optimization methods, it has a…

Information Theory · Computer Science 2017-01-12 Shuai Huang , Trac D. Tran

We present a novel compressed sensing recovery algorithm - termed Bayesian Optimal Structured Signal Approximate Message Passing (BOSSAMP) - that jointly exploits the prior distribution and the structured sparsity of a signal that shall be…

Information Theory · Computer Science 2015-08-06 Martin Mayer , Norbert Goertz

The sparse Beyesian learning (also referred to as Bayesian compressed sensing) algorithm is one of the most popular approaches for sparse signal recovery, and has demonstrated superior performance in a series of experiments. Nevertheless,…

Information Theory · Computer Science 2015-01-21 Fuwei Li , Jun Fang , Huiping Duan , Zhi Chen , Hongbin Li

We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…

Information Theory · Computer Science 2014-10-22 Yanting Ma , Junan Zhu , Dror Baron

When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE). If this distribution was apriori known, then…

Information Theory · Computer Science 2015-06-05 Jeremy P. Vila , Philip Schniter

We consider the estimation of an i.i.d. (possibly non-Gaussian) vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise…

Information Theory · Computer Science 2012-12-04 Ulugbek S. Kamilov , Sundeep Rangan , Alyson K. Fletcher , Michael Unser

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP,…

Information Theory · Computer Science 2009-11-24 David L. Donoho , Arian Maleki , Andrea Montanari

In this paper, we consider the problem of multi-resolution compressed sensing (MR-CS) reconstruction, which has received little attention in the literature. Instead of always reconstructing the signal at the original high resolution (HR),…

Information Theory · Computer Science 2016-01-21 Xing Wang , Jie Liang

This letter proposes a novel message-passing algorithm for signal recovery in compressed sensing. The proposed algorithm solves the disadvantages of approximate message-passing (AMP) and orthogonal/vector AMP, and realizes their advantages.…

Information Theory · Computer Science 2020-04-22 Keigo Takeuchi

In phase retrieval, the goal is to recover a complex signal from the magnitude of its linear measurements. While many well-known algorithms guarantee deterministic recovery of the unknown signal using i.i.d. random measurement matrices,…

Information Theory · Computer Science 2017-03-24 Boshra Rajaei , Sylvain Gigan , Florent Krzakala , Laurent Daudet

In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing (BOSSAMP) algorithm on the jointly sparse real and…

Information Theory · Computer Science 2015-11-30 Gabor Hannak , Martin Mayer , Gerald Matz , Norbert Goertz
‹ Prev 1 2 3 10 Next ›