English
Related papers

Related papers: Asymptotic Analysis of Complex LASSO via Complex A…

200 papers

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 sparse linear regression formulation is the l1 regularized least squares, which is also known as least absolute shrinkage and selection operator (LASSO). Approximate message passing (AMP) has been proved to asymptotically achieve…

Information Theory · Computer Science 2021-07-01 Yanting Ma , Min Kang , Jack W. Silverstein , Dror Baron

We consider the problem of recovering a block (or group) sparse signal from an underdetermined set of random linear measurements, which appear in compressed sensing applications such as radar and imaging. Recent results of Donoho,…

Information Theory · Computer Science 2013-03-12 Armeen Taeb , Arian Maleki , Christoph Studer , Richard Baraniuk

Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In…

Information Theory · Computer Science 2013-11-04 Ali Mousavi , Arian Maleki , Richard G. Baraniuk

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

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

Quantum state tomography (QST) is an indispensable tool for characterizing many-body quantum systems. However, due to the exponential scaling of the cost of the protocol with system size, many approaches have been developed for quantum…

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

In this paper, we bring together two trends that have recently emerged in sparse signal recovery: the problem of sparse signals that stem from finite alphabets and the techniques that introduce concave penalties. Specifically, we show that…

Optimization and Control · Mathematics 2018-12-04 Sophie M. Fosson

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á

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

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

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

This paper presents a unified framework to understand the dynamics of message-passing algorithms in compressed sensing. State evolution is rigorously analyzed for a general error model that contains the error model of approximate…

Information Theory · Computer Science 2019-01-17 Keigo Takeuchi

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

This paper proposes Bayes-optimal convolutional approximate message-passing (CAMP) for signal recovery in compressed sensing. CAMP uses the same low-complexity matched filter (MF) for interference suppression as approximate message-passing…

Information Theory · Computer Science 2021-04-05 Keigo Takeuchi

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

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

Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important both for theory and practice. We present a formula that…

Information Theory · Computer Science 2013-01-09 David Donoho , Iain Johnstone , Andrea Montanari