English
Related papers

Related papers: Message Passing Algorithms for Compressed Sensing:…

200 papers

Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the…

Information Theory · Computer Science 2018-10-23 Cynthia Rush , Ramji Venkataramanan

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

Recovering a sparse signal from an undersampled set of random linear measurements is the main problem of interest in compressed sensing. In this paper, we consider the case where both the signal and the measurements are complex. We study…

Information Theory · Computer Science 2015-03-19 Arian Maleki , Laura Anitori , Zai Yang , Richard Baraniuk

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

Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…

Information Theory · Computer Science 2025-01-22 Burak Çakmak , Giuseppe Caire

For certain sensing matrices, the Approximate Message Passing (AMP) algorithm efficiently reconstructs undersampled signals. However, in Magnetic Resonance Imaging (MRI), where Fourier coefficients of a natural image are sampled with…

Signal Processing · Electrical Eng. & Systems 2020-09-08 Charles Millard , Aaron T Hess , Boris Mailhé , Jared Tanner

Approximate message passing (AMP) is a scalable, iterative approach to signal recovery. For structured random measurement ensembles, including independent and identically distributed (i.i.d.) Gaussian and rotationally-invariant matrices,…

Information Theory · Computer Science 2023-06-27 Dang Qua Nguyen , Taejoon Kim

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

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

A common goal in many research areas is to reconstruct an unknown signal x from noisy linear measurements. Approximate message passing (AMP) is a class of low-complexity algorithms for efficiently solving such high-dimensional regression…

Information Theory · Computer Science 2019-05-07 Hangjin Liu , Cynthia Rush , Dror Baron

Approximate Message Passing (AMP) algorithms provide a valuable tool for studying mean-field approximations and dynamics in a variety of applications. Although these algorithms are often first derived for matrices having independent…

Probability · Mathematics 2024-09-10 Tianhao Wang , Xinyi Zhong , Zhou Fan

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 the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

We propose a tensor generalized approximate message passing (TeG-AMP) algorithm for low-rank tensor inference, which can be used to solve tensor completion and decomposition problems. We derive TeG-AMP algorithm as an approximation of the…

Machine Learning · Computer Science 2025-04-02 Yinchuan Li , Guangchen Lan , Xiaodong Wang

Approximate message passing (AMP) is a class of low-complexity, scalable algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal from noisy, linear measurements. AMP is an iterative…

Information Theory · Computer Science 2019-08-27 Yanting Ma , Cynthia Rush , Dror Baron

We consider the problem of decoding a discrete signal of categorical variables from the observation of several histograms of pooled subsets of it. We present an Approximate Message Passing (AMP) algorithm for recovering the signal in the…

Information Theory · Computer Science 2020-01-22 Ahmed El Alaoui , Aaditya Ramdas , Florent Krzakala , Lenka Zdeborova , Michael I. Jordan

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP)…

Information Theory · Computer Science 2020-01-22 Andre Manoel , Florent Krzakala , Marc Mézard , Lenka Zdeborová

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

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 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