English
Related papers

Related papers: Generalized Approximate Message-Passing for Compre…

200 papers

Generalised approximate message passing (GAMP) is an approximate Bayesian estimation algorithm for signals observed through a linear transform with a possibly non-linear subsequent measurement model. By leveraging prior information about…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Christian Schou Oxvig , Thomas Arildsen

This paper addresses the reconstruction of sparse signals from generalized linear measurements. Signal sparsity is assumed to be sublinear in the signal dimension while it was proportional to the signal dimension in conventional research.…

Information Theory · Computer Science 2026-04-13 Keigo Takeuchi

Decentralized generalized approximate message-passing (GAMP) is proposed for compressed sensing from distributed generalized linear measurements in a tree-structured network. Consensus propagation is used to realize average consensus…

Information Theory · Computer Science 2024-06-05 Keigo Takeuchi

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

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

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

In this paper, we study the compressed sensing reconstruction problem with generalized elastic net prior (GENP), where a sparse signal is sampled via a noisy underdetermined linear observation system, and an additional initial estimation of…

Information Theory · Computer Science 2015-02-19 Xing Wang , Jie Liang

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

Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal -- sometimes greatly so. This paper develops generalized approximate message passing (GAMP) algorithms for…

Information Theory · Computer Science 2015-03-24 Ulugbek Kamilov , Vivek K. Goyal , Sundeep Rangan

In cosparse analysis compressive sensing (CS), one seeks to estimate a non-sparse signal vector from noisy sub-Nyquist linear measurements by exploiting the knowledge that a given linear transform of the signal is cosparse, i.e., has…

Information Theory · Computer Science 2014-10-21 Mark Borgerding , Philip Schniter , Sundeep Rangan

We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message…

Information Theory · Computer Science 2012-08-15 Sundeep Rangan

In this paper we consider the generalized approximate message passing (GAMP) algorithm for recovering a sparse signal from modulo samples of randomized projections of the unknown signal. The modulo samples are obtained by a self-reset (SR)…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Osman Musa , Peter Jung , Norbert Goertz

Generalized approximate message passing (GAMP) is a promising technique for unknown signal reconstruction of generalized linear models (GLM). However, it requires that the transformation matrix has independent and identically distributed…

Information Theory · Computer Science 2021-10-18 Feiyan Tian , Lei Liu , Xiaoming Chen

Approximate Message Passing (AMP) is a general framework for iterative algorithms, originally developed for compressed sensing and later extended to a wide range of high-dimensional inference problems. Although recent work has advanced…

Signal Processing · Electrical Eng. & Systems 2026-04-24 Vishnu Teja Kunde , Alessandro Mirri , Jean-Francois Chamberland , Enrico Paolini

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 Generalized Linear Estimation (GLE) problems, we seek to estimate a signal that is observed through a linear transform followed by a component-wise, possibly nonlinear and noisy, channel. In the Bayesian optimal setting, Generalized…

Disordered Systems and Neural Networks · Physics 2021-02-03 Luca Saglietti , Yue M. Lu , Carlo Lucibello

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

The generalized linear model (GLM), where a random vector $\boldsymbol{x}$ is observed through a noisy, possibly nonlinear, function of a linear transform output $\boldsymbol{z}=\boldsymbol{Ax}$, arises in a range of applications such as…

Information Theory · Computer Science 2016-12-06 Philip Schniter , Sundeep Rangan , Alyson K. Fletcher

We propose two novel approaches to the recovery of an (approximately) sparse signal from noisy linear measurements in the case that the signal is a priori known to be non-negative and obey given linear equality constraints, such as simplex…

Information Theory · Computer Science 2015-06-17 Jeremy Vila , Philip Schniter

Generalized approximate message passing (GAMP) is a computationally efficient algorithm for estimating an unknown signal $w_0\in\mathbb{R}^N$ from a random linear measurement $y= Xw_0 + \epsilon\in\mathbb{R}^M$, where…

Information Theory · Computer Science 2025-08-06 Takashi Takahashi
‹ Prev 1 2 3 10 Next ›