English
Related papers

Related papers: Signal recovery using expectation consistent appro…

200 papers

We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements…

Information Theory · Computer Science 2013-06-05 Joel Andersson , Jan-Olov Strömberg

Recently we extended Approximate message passing (AMP) algorithm to be able to handle general invariant matrix ensembles. In this contribution we extend our S-AMP approach to non-linear observation models. We obtain generalized AMP (GAMP)…

Information Theory · Computer Science 2015-01-27 Burak Çakmak , Ole Winther , Bernard H. Fleury

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

Compressed sensing (CS) deals with the problem of reconstructing a sparse vector from an under-determined set of observations. Approximate message passing (AMP) is a technique used in CS based on iterative thresholding and inspired by…

Signal Processing · Electrical Eng. & Systems 2019-07-12 Viktoria Schram , Ali Bereyhi , Jan-Nico Zaech , Ralf R. Müller , Wolfgang H. Gerstacker

Finding a suitable measurement matrix is an important topic in compressed sensing. Though the known random matrix, whose entries are drawn independently from a certain probability distribution, can be used as a measurement matrix and…

Information Theory · Computer Science 2013-07-09 Yi-Zheng Fan , Tao Huang , Ming Zhu

Compressed sensing (CS) demonstrates that sparse signals can be recovered from underdetermined linear measurements. We focus on the joint sparse recovery problem where multiple signals share the same common sparse support sets, and they are…

Information Theory · Computer Science 2011-02-17 Jongmin Kim , Woohyuk Chang , Bangchul Jung , Dror Baron , Jong Chul Ye

For the problem of binary linear classification and feature selection, we propose algorithmic approaches to classifier design based on the generalized approximate message passing (GAMP) algorithm, recently proposed in the context of…

Information Theory · Computer Science 2015-06-18 Justin Ziniel , Philip Schniter , Per Sederberg

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

The replica method is a non-rigorous but well-known technique from statistical physics used in the asymptotic analysis of large, random, nonlinear problems. This paper applies the replica method, under the assumption of replica symmetry, to…

Information Theory · Computer Science 2015-01-20 Sundeep Rangan , Alyson K. Fletcher , Vivek K Goyal

This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish an area property based on the approximate message passing (AMP) algorithm. Under…

Information Theory · Computer Science 2021-06-07 Lei Liu , Chulong Liang , Junjie Ma , Li Ping

Vector approximate message passing (VAMP) is an efficient approximate inference algorithm used for generalized linear models. Although VAMP exhibits excellent performance, particularly when measurement matrices are sampled from rotationally…

Information Theory · Computer Science 2025-08-05 Takashi Takahashi , Yoshiyuki Kabashima

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

In compressed sensing, one wishes to acquire an approximately sparse high-dimensional signal $x\in\mathbb{R}^n$ via $m\ll n$ noisy linear measurements, then later approximately recover $x$ given only those measurement outcomes. Various…

Information Theory · Computer Science 2016-06-07 Tom Morgan , Jelani Nelson

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

The typical approach for recovery of spatially correlated signals is regularized least squares with a coupled regularization term. In the Bayesian framework, this algorithm is seen as a maximum-a-posterior estimator whose postulated prior…

Information Theory · Computer Science 2018-05-31 Ali Bereyhi , Saeid Haghighatshoar , Ralf R. Müller

Auto-Encoders are unsupervised models that aim to learn patterns from observed data by minimizing a reconstruction cost. The useful representations learned are often found to be sparse and distributed. On the other hand, compressed sensing…

Machine Learning · Statistics 2017-07-14 Devansh Arpit , Yingbo Zhou , Hung Q. Ngo , Nils Napp , Venu Govindaraju

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…

Information Theory · Computer Science 2021-01-05 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Yunfeng Guan

Orthogonal approximate message-passing (OAMP) is proposed for signal recovery from right-orthogonally invariant linear measurements with spatial coupling. Conventional state evolution is generalized to a unified framework of state evolution…

Information Theory · Computer Science 2023-05-22 Keigo Takeuchi

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

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li
‹ Prev 1 3 4 5 6 7 10 Next ›