English
Related papers

Related papers: Stable Signal Recovery from Phaseless Measurements

200 papers

Noiseless compressive sensing is a protocol that enables undersampling and later recovery of a signal without loss of information. This compression is possible because the signal is usually sufficiently sparse in a given basis. Currently,…

Information Theory · Computer Science 2024-07-22 D. Barbier , C Lucibello , L. Saglietti , F. Krzakala , L. Zdeborova

In this paper, we consider the sparse phase retrieval problem, recovering an $s$-sparse signal $\bm{x}^{\natural}\in\mathbb{R}^n$ from $m$ phaseless samples $y_i=|\langle\bm{x}^{\natural},\bm{a}_i\rangle|$ for $i=1,\ldots,m$. Existing…

Numerical Analysis · Mathematics 2021-10-15 Jian-Feng Cai , Jingzhi Li , Xiliang Lu , Juntao You

This paper considers solving the unconstrained $\ell_q$-norm ($0\leq q<1$) regularized least squares ($\ell_q$-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via…

Information Theory · Computer Science 2016-03-16 Fei Wen , Yuan Yang , Peilin Liu , Rendong Ying , Yipeng Liu

In this paper, we consider recovering the signal $\bm{x}\in\mathbb{R}^{n}$ from its few noisy measurements $\bm{b}=A\bm{x}+\bm{z}$, where $A\in\mathbb{R}^{m\times n}$ with $m\ll n$ is the measurement matrix, and $\bm{z}\in\mathbb{R}^{m}$ is…

Numerical Analysis · Computer Science 2018-12-11 Wendong Wang , Feng Zhang , Zhi Wang , Jianjun Wang

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

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

We develop a fast phase retrieval method which can utilize a large class of local phaseless correlation-based measurements in order to recover a given signal ${\bf x} \in \mathbb{C}^d$ (up to an unknown global phase) in near-linear…

Numerical Analysis · Mathematics 2016-07-12 Mark Iwen , Aditya Viswanathan , Yang Wang

The phase retrieval problem asks to recover a natural signal $y_0 \in \mathbb{R}^n$ from $m$ quadratic observations, where $m$ is to be minimized. As is common in many imaging problems, natural signals are considered sparse with respect to…

Information Theory · Computer Science 2018-07-12 Paul Hand , Oscar Leong , Vladislav Voroninski

This paper considers the problem of recovering a $k$-sparse, $N$-dimensional complex signal from Fourier magnitude measurements. It proposes a Fourier optics setup such that signal recovery up to a global phase factor is possible with very…

Information Theory · Computer Science 2014-10-28 Çağkan Yapar , Volker Pohl , Holger Boche

Compressed sensing (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently we developed the methodology of using (dense) Compressed Counting for recovering nonnegative K-sparse signals. In this paper, we adopt…

Methodology · Statistics 2014-01-03 Ping Li , Cun-Hui Zhang , Tong Zhang

The problem of detecting the sparsity pattern of a k-sparse vector in R^n from m random noisy measurements is of interest in many areas such as system identification, denoising, pattern recognition, and compressed sensing. This paper…

Information Theory · Computer Science 2010-09-03 Alyson K. Fletcher , Sundeep Rangan , Vivek K. Goyal

We consider faithfully combining phase retrieval with classical compressed sensing. Inspired by the recent novel formulation for phase retrieval called PhaseMax, we present and analyze SparsePhaseMax, a linear program for phaseless…

Information Theory · Computer Science 2017-03-06 Paul Hand , Vladislav Voroninski

The aim of sparse phase retrieval is to recover a $k$-sparse signal $\mathbf{x}_0\in \mathbb{C}^{d}$ from quadratic measurements $|\langle \mathbf{a}_i,\mathbf{x}_0\rangle|^2$ where $\mathbf{a}_i\in \mathbb{C}^d, i=1,\ldots,m$. Noting…

Functional Analysis · Mathematics 2021-05-05 Yu Xia , Zhiqiang Xu

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified `base' frequencies $\{u_i\}_{i=1}^M$, where $M$ is the number of…

Information Theory · Computer Science 2018-02-09 Eeshan Malhotra , Himanshu Pandotra , Ajit Rajwade , Karthik S. Gurumoorthy

The most frequently used condition for sampling matrices employed in compressive sampling is the restricted isometry (RIP) property of the matrix when restricted to sparse signals. At the same time, imposing this condition makes it…

Information Theory · Computer Science 2013-03-11 Alexander Barg , Arya Mazumdar , Rongrong Wang

We consider an $\ell_2$-regularized non-convex optimization problem for recovering signals from their noisy phaseless observations. We design and study the performance of a message passing algorithm that aims to solve this optimization…

Information Theory · Computer Science 2018-02-27 Junjie Ma , Ji Xu , Arian Maleki

The goal of phase-only compressed sensing is to recover a structured signal $\mathbf{x}$ from the phases $\mathbf{z} = {\rm sign}(\mathbf{\Phi}\mathbf{x})$ under some complex-valued sensing matrix $\mathbf{\Phi}$. Exact reconstruction of…

Information Theory · Computer Science 2025-01-22 Junren Chen , Lexiao Lai , Arian Maleki

Sparse support recovery (SSR) is an important part of the compressive sensing (CS). Most of the current SSR methods are with the full information measurements. But in practice the amplitude part of the measurements may be seriously…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan , Fei Wen , Jia Xu , Yingning Peng

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a $m$-dimensional $k$-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for…

Machine Learning · Statistics 2016-08-09 Abolfazl Hashemi , Haris Vikalo