English
Related papers

Related papers: Distributed Approximate Message Passing for Compre…

200 papers

Approximate message passing (AMP) is an algorithmic framework for solving linear inverse problems from noisy measurements, with exciting applications such as reconstructing images, audio, hyper spectral images, and various other signals,…

Information Theory · Computer Science 2017-02-13 Junan Zhu , Ryan Pilgrim , Dror Baron

X-ray Computed Tomography (CT) reconstruction from a sparse number of views is a useful way to reduce either the radiation dose or the acquisition time, for example in fixed-gantry CT systems, however this results in an ill-posed inverse…

Data Structures and Algorithms · Computer Science 2020-11-04 Alessandro Perelli , Michael Lexa , Ali Can , Mike E. Davies

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

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 this letter, we propose a turbo compressed sensing algorithm with partial discrete Fourier transform (DFT) sensing matrices. Interestingly, the state evolution of the proposed algorithm is shown to be consistent with that derived using…

Information Theory · Computer Science 2014-09-10 Junjie Ma , Xiaojun Yuan , Li Ping

In this work the dynamic compressive sensing (CS) problem of recovering sparse, correlated, time-varying signals from sub-Nyquist, non-adaptive, linear measurements is explored from a Bayesian perspective. While there has been a handful of…

Information Theory · Computer Science 2015-06-05 Justin Ziniel , Philip Schniter

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

We consider the problem of recovering an unknown signal ${\mathbf x}\in {\mathbb R}^n$ from general nonlinear measurements obtained through a generalized linear model (GLM), i.e., ${\mathbf y}= f\left({\mathbf A}{\mathbf x}+{\mathbf…

Information Theory · Computer Science 2022-10-18 Jiang Zhu , Xiangming Meng , Xupeng Lei , Qinghua Guo

Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions. However, AMP only applies to independent identically distributed (IID)…

Information Theory · Computer Science 2021-06-07 Lei Liu , Shunqi Huang , Brian M. Kurkoski

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

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

Characterizing the distribution of high-dimensional statistical estimators is a challenging task, due to the breakdown of classical asymptotic theory in high dimension. This paper makes progress towards this by developing non-asymptotic…

Statistics Theory · Mathematics 2024-01-09 Gen Li , Yuting Wei

Designing efficient sparse recovery algorithms that could handle noisy quantized measurements is important in a variety of applications -- from radar to source localization, spectrum sensing and wireless networking. We take advantage of the…

Signal Processing · Electrical Eng. & Systems 2022-05-24 Shuai Huang , Deqiang Qiu , Trac D. Tran

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

We propose and analyze an approximate message passing (AMP) algorithm for the matrix tensor product model, which is a generalization of the standard spiked matrix models that allows for multiple types of pairwise observations over a…

Machine Learning · Statistics 2023-06-28 Riccardo Rossetti , Galen Reeves

Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…

Information Theory · Computer Science 2018-03-05 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher , Subrata Sarkar

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

This paper considers a discrete-valued signal estimation scheme based on a low-complexity Bayesian optimal message passing algorithm (MPA) for solving massive linear inverse problems under highly correlated measurements. Gaussian belief…

Signal Processing · Electrical Eng. & Systems 2024-11-14 Tomoharu Furudoi , Takumi Takahashi , Shinsuke Ibi , Hideki Ochiai

We extend the generalized approximate message passing (G-AMP) approach, originally proposed for high-dimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its…

Information Theory · Computer Science 2015-06-17 Jason T. Parker , Philip Schniter , Volkan Cevher

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