English
Related papers

Related papers: Perfect reconstruction of sparse signals using non…

200 papers

In this paper, we extend the bilinear generalized approximate message passing (BiG-AMP) approach, originally proposed for high-dimensional generalized bilinear regression, to the multi-layer case for the handling of cascaded problem such as…

Information Theory · Computer Science 2021-09-08 Qiuyun Zou , Haochuan Zhang , Hongwen Yang

The constrained $\ell_p^p/\ell_q^p$ ratio model is scale invariant and is therefore attractive for sparse signal recovery. However, its nonconvex, nonsmooth, and fractional structure makes a unified theoretical and algorithmic analysis…

Optimization and Control · Mathematics 2026-05-26 Lang Yu , Nan-jing Huang

In this paper, we studied the problem of beam alignment for millimeter wave (mmWave) communications, in which we assume a hybrid analog and digital beamforming structure is employed at the transmitter (i.e. base station), and an…

Information Theory · Computer Science 2019-09-04 Xingjian Li , Jun Fang , Huiping Duan , Zhi Chen , Hongbin Li

In compressed sensing, the l0-norm minimization of sparse signal reconstruction is NP-hard. Recent work shows that compared with the best convex relaxation (l1-norm), nonconvex penalties can better approximate the l0-norm and can…

Signal Processing · Electrical Eng. & Systems 2018-05-03 Hao Wang , Zhanglei Shi , Chi-Sing Leung , Hing Cheung So

Recently, the 1-bit compressive sensing (1-bit CS) has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that…

Information Theory · Computer Science 2015-07-23 Yun-Bin Zhao , Chunlei XU

Consider the problem of estimating a low-rank matrix when its entries are perturbed by Gaussian noise. If the empirical distribution of the entries of the spikes is known, optimal estimators that exploit this knowledge can substantially…

Statistics Theory · Mathematics 2019-08-08 Andrea Montanari , Ramji Venkataramanan

Novel sparse reconstruction algorithms are proposed for beamspace channel estimation in massive multiple-input multiple-output systems. The proposed algorithms minimize a least-squares objective having a nonconvex regularizer. This…

Information Theory · Computer Science 2021-12-02 Pengxia Wu , Julian Cheng

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

Orthogonal/vector approximate message-passing (AMP) is a powerful message-passing (MP) algorithm for signal reconstruction in compressed sensing. This paper proves the convergence of Bayes-optimal orthogonal/vector AMP in the large system…

Information Theory · Computer Science 2022-04-26 Keigo Takeuchi

The problem of super-resolution compressive sensing (SR-CS) is crucial for various wireless sensing and communication applications. Existing methods often suffer from limited resolution capabilities and sensitivity to hyper-parameters,…

Signal Processing · Electrical Eng. & Systems 2025-08-12 Yufan Zhou , Jingyi Li , Wenkang Xu , An Liu

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

Information Theory · Computer Science 2019-05-27 Aleksandr Aravkin , James Burke , Daiwei He

Sparse modeling has been widely and successfully used in many applications such as computer vision, machine learning, and pattern recognition. Accompanied with those applications, significant research has studied the theoretical limits and…

Information Theory · Computer Science 2016-10-04 Yuki Itoh , Marco F. Duarte , Mario Parente

We study the performance of a Bayesian statistician who estimates a rank-one signal corrupted by non-symmetric rotationally invariant noise with a generic distribution of singular values. As the signal-to-noise ratio and the noise structure…

Information Theory · Computer Science 2023-02-09 Teng Fu , YuHao Liu , Jean Barbier , Marco Mondelli , ShanSuo Liang , TianQi Hou

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

This paper introduces a random modulation technique that is decoupled from the channel matrix, allowing it to be applied to arbitrary norm-bounded and spectrally convergent channel matrices. The proposed random modulation constructs an…

Information Theory · Computer Science 2026-01-01 Lei Liu , Yuhao Chi , Shunqi Huang

One-bit compressive sensing (CS) is an advanced version of sparse recovery in which the sparse signal of interest can be recovered from extremely quantized measurements. Namely, only the sign of each measurement is available to us. In many…

Information Theory · Computer Science 2019-10-22 Hossein Beheshti , Sajad Daei , Farzan Haddadi

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

Approximate Message Passing (AMP) is an efficient iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions, such as sparse systems. In AMP, a so-called Onsager term is added to…

Information Theory · Computer Science 2023-01-16 Lei Liu , Yiyao Cheng , Shansuo Liang , Jonathan H. Manton , Li Ping

Consider a spectrally sparse signal $\boldsymbol{x}$ that consists of $r$ complex sinusoids with or without damping. We study the robust recovery problem for the spectrally sparse signal under the fully observed setting, which is about…

Information Theory · Computer Science 2021-02-05 HanQin Cai , Jian-Feng Cai , Tianming Wang , Guojian Yin

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