English
Related papers

Related papers: Towards Sample-Optimal Compressive Phase Retrieval…

200 papers

In this paper, we study the problem of signal estimation from noisy non-linear measurements when the unknown $n$-dimensional signal is in the range of an $L$-Lipschitz continuous generative model with bounded $k$-dimensional inputs. We make…

Machine Learning · Statistics 2020-10-09 Zhaoqiang Liu , Jonathan Scarlett

This paper studies sequential methods for recovery of sparse signals in high dimensions. When compared to fixed sample size procedures, in the sparse setting, sequential methods can result in a large reduction in the number of samples…

Information Theory · Computer Science 2014-10-07 Matthew L. Malloy , Robert Nowak

In phase-only compressive sensing (PO-CS), our goal is to recover low-complexity signals (e.g., sparse signals, low-rank matrices) from the phase of complex linear measurements. While perfect recovery of signal direction in PO-CS was…

Information Theory · Computer Science 2023-07-10 Junren Chen , Michael K. Ng

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

Compressed sensing is a technique for recovering a high-dimensional signal from lower-dimensional data, whose components represent partial information about the signal, utilizing prior knowledge on the sparsity of the signal. For further…

Information Theory · Computer Science 2014-02-18 Yingying Xu , Yoshiyuki Kabashima

The problem of recovering a signal $\mathbf{x}\in \mathbb{R}^n$ from a set of magnitude measurements $y_i=|\langle \mathbf{a}_i, \mathbf{x} \rangle |, \; i=1,\ldots,m$ is referred as phase retrieval, which has many applications in fields of…

Information Theory · Computer Science 2021-01-12 Jianfeng Cai , Meng Huang , Dong Li , Yang Wang

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

In this paper, we study phase retrieval under model misspecification and generative priors. In particular, we aim to estimate an $n$-dimensional signal $\mathbf{x}$ from $m$ i.i.d.~realizations of the single index model $y =…

Machine Learning · Statistics 2022-10-12 Zhaoqiang Liu , Xinshao Wang , Jiulong Liu

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

This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal $x \in \mathbb{R}^p$ from noisy quadratic measurements $y_j = (a_j' x )^2 + \epsilon_j$, $j=1, \ldots, m$, with independent sub-exponential noise…

Statistics Theory · Mathematics 2015-06-11 T. Tony Cai , Xiaodong Li , Zongming Ma

In signal processing and data recovery, reconstructing a signal from quadratic measurements poses a significant challenge, particularly in high-dimensional settings where measurements $m$ is far less than the signal dimension $n$ (i.e., $m…

Information Theory · Computer Science 2025-07-11 Jinming Wen , Yi Hu , Meng Huang

We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees for this framework, covering varying degrees of knowledge of…

Information Theory · Computer Science 2012-09-27 Graeme Pope , Annina Bracher , Christoph Studer

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Many applications concern sparse signals, for example, detecting anomalies from the differences between consecutive images taken by surveillance cameras. This paper focuses on the problem of recovering a K-sparse signal x in N dimensions.…

Machine Learning · Statistics 2013-02-06 Ping Li , Cun-Hui Zhang

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of…

Statistics Theory · Mathematics 2008-06-04 Wei Wang , Martin J. Wainwright , Kannan Ramchandran

In this paper, we discuss application of iterative Stochastic Optimization routines to the problem of sparse signal recovery from noisy observation. Using Stochastic Mirror Descent algorithm as a building block, we develop a multistage…

Machine Learning · Statistics 2022-03-31 Anatoli Juditsky , Andrei Kulunchakov , Hlib Tsyntseus

Intensively growing approach in signal processing and acquisition, the Compressive Sensing approach, allows sparse signals to be recovered from small number of randomly acquired signal coefficients. This paper analyses some of the commonly…

Signal Processing · Electrical Eng. & Systems 2018-02-21 Tamara Koljensic , Caslav Labudovic

This work investigates the problem of signal recovery from undersampled noisy sub-Gaussian measurements under the assumption of a synthesis-based sparsity model. Solving the $\ell^1$-synthesis basis pursuit allows for a simultaneous…

Information Theory · Computer Science 2020-04-16 Maximilian März , Claire Boyer , Jonas Kahn , Pierre Weiss

We investigate the reconstruction of multivariate functions from samples using sparse recovery techniques. For Square Root Lasso, Orthogonal Matching Pursuit, and Compressive Sampling Matching Pursuit, we demonstrate both theoretically and…

Numerical Analysis · Mathematics 2026-01-21 Moritz Moeller , Sebastian Neumayer , Kateryna Pozharska , Tizian Sommerfeld , Tino Ullrich
‹ Prev 1 3 4 5 6 7 10 Next ›