English
Related papers

Related papers: Phase Transitions in Phase-Only Compressed Sensing

200 papers

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

Compressed sensing (CS) demonstrates that a sparse, or compressible signal can be acquired using a low rate acquisition process below the Nyquist rate, which projects the signal onto a small set of vectors incoherent with the sparsity…

Information Theory · Computer Science 2014-02-25 Yuli Sun , Jinxu Tao

Phase modulation is a commonly used modulation mode in digital communication, which usually brings phase sparsity to digital signals. It is naturally to connect the sparsity with the newly emerged theory of compressed sensing (CS), which…

Information Theory · Computer Science 2015-01-05 Zhengli Xing , Jie Zhou , Jiangfeng Ye , Jun Yan , Lin Zou , Qun Wan

This paper considers the fundamental limit of compressed sensing for i.i.d. signal distributions and i.i.d. Gaussian measurement matrices. Its main contribution is a rigorous characterization of the asymptotic mutual information (MI) and…

Information Theory · Computer Science 2016-07-12 Galen Reeves , Henry D. Pfister

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Numerical Analysis · Mathematics 2014-04-02 Guangliang Chen , Atul Divekar , Deanna Needell

In many applications, signals are measured according to a linear process, but the phases of these measurements are often unreliable or not available. To reconstruct the signal, one must perform a process known as phase retrieval. This paper…

Functional Analysis · Mathematics 2013-07-30 Matthew Fickus , Dustin G. Mixon , Aaron A. Nelson , Yang Wang

In the undersampled phase retrieval problem, the goal is to recover an $N$-dimensional complex signal $\mathbf{x}$ from only $M<N$ noisy intensity measurements without phase information. This problem has drawn a lot of attention to reduce…

Information Theory · Computer Science 2017-10-11 Tianyu Qiu , Daniel P. Palomar

Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and…

Information Theory · Computer Science 2018-02-16 Fintan Hegarty , Padraig Ó Catháin , Yunbin Zhao

In the problem of one-bit compressed sensing, the goal is to find a $\delta$-close estimation of a $k$-sparse vector $x \in \mathbb{R}^n$ given the signs of the entries of $y = \Phi x$, where $\Phi$ is called the measurement matrix. For the…

Information Theory · Computer Science 2016-09-22 Vasileios Nakos

Compressed sensing aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

Conventional sparse phase retrieval schemes can recover sparse signals from the magnitude of linear measurements only up to a global phase ambiguity. This work proposes a novel approach that instead utilizes the magnitude of affine…

Information Theory · Computer Science 2021-05-25 Ming-Hsun Yang , Y. -W. Peter Hong , Jwo-Yuh Wu

We study the stable recovery of complex $k$-sparse signals from as few phaseless measurements as possible. The main result is to show that one can employ $\ell_1$ minimization to stably recover complex $k$-sparse signals from $m\geq O(k\log…

Functional Analysis · Mathematics 2019-11-27 Yu Xia , Zhiqiang Xu

We develop a Bayesian framework for sensing which adapts the sensing time and/or basis functions to the instantaneous sensing quality measured in terms of the expected posterior mean-squared error. For sparse Gaussian sources a significant…

Information Theory · Computer Science 2018-02-12 Ralf R. Müller , Ali Bereyhi , Christoph F. Mecklenbräuker

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key…

Information Theory · Computer Science 2013-10-23 T. Tony Cai , Anru Zhang

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is…

Information Theory · Computer Science 2012-11-22 Mohammad Golbabaee , Pierre Vandergheynst

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

Generally, phase retrieval problem can be viewed as the reconstruction of a function/signal from only the magnitude of the linear measurements. These measurements can be, for example, the Fourier transform of the density function.…

Optimization and Control · Mathematics 2019-11-21 Bing Gao , Haixia Liu , Yang Wang

Compressed sensing provides an efficient framework for reconstructing wave signals from reduced measurements. For multi-channel buoy data, the three displacement components exhibit intrinsic correlations, as wave motion contributes…

Geophysics · Physics 2026-05-26 Qingyu Jiang , Henrik Kalisch , Michel Benoit , Karoline Holand , Patrick Sprenger

Compressed sensing has demonstrated that a general signal $\boldsymbol{x} \in \mathbb{F}^n$ ($\mathbb{F}\in \{\mathbb{R},\mathbb{C}\}$) can be estimated from few linear measurements with an error {proportional to} the best $k$-term…

Functional Analysis · Mathematics 2025-10-28 Yu Xia , Zhiqiang Xu

The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics. In the compressed sensing framework, tailored methods have been…

Optimization and Control · Mathematics 2019-07-24 Sophie M. Fosson , Mohammad Abuabiah