English
Related papers

Related papers: Distributed Approximate Message Passing for Compre…

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

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

We study COMP-AMS, a distributed optimization framework based on gradient averaging and adaptive AMSGrad algorithm. Gradient compression with error feedback is applied to reduce the communication cost in the gradient transmission process.…

Machine Learning · Statistics 2022-05-12 Xiaoyun Li , Belhal Karimi , Ping 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

The ubiquity of approximately sparse data has led a variety of com- munities to great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying…

Information Theory · Computer Science 2016-07-27 Christophe Schülke , Francesco Caltagirone , Lenka Zdeborová

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

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

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

In this paper, we address the problem of recovering complex-valued signals from a set of complex-valued linear measurements. Approximate message passing (AMP) is one state-of-the-art algorithm to recover real-valued sparse signals. However,…

Information Theory · Computer Science 2016-01-26 Xiangming Meng , Sheng Wu , Linling Kuang , Jianhua Lu

In this paper, we consider a general form of noisy compressive sensing (CS) where the sensing matrix is not precisely known. Such cases exist when there are imperfections or unknown calibration parameters during the measurement process.…

Signal Processing · Electrical Eng. & Systems 2018-08-28 Jiang Zhu , Qi Zhang , Xiangming Meng , Zhiwei Xu

This letter proposes a novel distributed compressed estimation scheme for sparse signals and systems based on compressive sensing techniques. The proposed scheme consists of compression and decompression modules inspired by compressive…

Information Theory · Computer Science 2015-02-05 S. Xu , R. C. de Lamare , H. V. Poor

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible…

Information Theory · Computer Science 2014-04-30 Matthew L. Malloy , Robert D. Nowak

The Recently proposed Vector Approximate Message Passing (VAMP) algorithm demonstrates a great reconstruction potential at solving compressed sensing related linear inverse problems. VAMP provides high per-iteration improvement, can utilize…

Information Theory · Computer Science 2024-10-30 Nikolajs Skuratovs , Michael Davies

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

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first pointed…

Information Theory · Computer Science 2020-01-14 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

Recently, several promising approximate message passing (AMP) based algorithms have been developed for bilinear recovery with model $\boldsymbol{Y}=\sum_{k=1}^K b_k \boldsymbol{A}_k \boldsymbol{C} +\boldsymbol{W} $, where $\{b_k\}$ and…

Information Theory · Computer Science 2021-02-24 Zhengdao Yuan , Qinghua Guo , Man Luo

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

In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been…

Information Theory · Computer Science 2014-01-14 Saeid Haghighatshoar

Compressed sensing (CS) is a challenging problem in image processing due to reconstructing an almost complete image from a limited measurement. To achieve fast and accurate CS reconstruction, we synthesize the advantages of two well-known…

Computer Vision and Pattern Recognition · Computer Science 2020-11-17 Nanyu Li , Charles C. Zhou

This paper addresses the reconstruction of an unknown signal vector with sublinear sparsity from generalized linear measurements. Generalized approximate message-passing (GAMP) is proposed via state evolution in the sublinear sparsity…

Information Theory · Computer Science 2025-02-21 Keigo Takeuchi