English
Related papers

Related papers: Robust phase retrieval with the swept approximate …

200 papers

Noiseless compressive sensing is a two-steps setting that allows for undersampling a sparse signal and then reconstructing it without loss of information. The LASSO algorithm, based on $\lone$ regularization, provides an efficient and…

Information Theory · Computer Science 2025-11-13 Damien Barbier , Carlo Lucibello , Luca Saglietti , Florent Krzakala , Lenka Zdeborová

We consider the robust phase retrieval problem of recovering the unknown signal from the magnitude-only measurements, where the measurements can be contaminated by both sparse arbitrary corruption and bounded random noise. We propose a new…

Machine Learning · Statistics 2018-01-08 Jinghui Chen , Lingxiao Wang , Xiao Zhang , Quanquan Gu

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an…

Information Theory · Computer Science 2013-06-24 Mark A. Davenport , Deanna Needell , Michael B. Wakin

Compressive image recovery is a challenging problem that requires fast and accurate algorithms. Recently, neural networks have been applied to this problem with promising results. By exploiting massively parallel GPU processing…

Machine Learning · Statistics 2017-11-08 Christopher A. Metzler , Ali Mousavi , Richard G. Baraniuk

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

Phase retrieval refers to the problem of recovering a high-dimensional vector $\boldsymbol{x} \in \mathbb{C}^N$ from the magnitude of its linear transform $\boldsymbol{z} = A \boldsymbol{x}$, observed through a noisy channel. To improve the…

Computation · Statistics 2024-10-10 Hajime Ueda , Shun Katakami , Masato Okada

In this paper we study the compressive sensing effects on 2D signals exhibiting sparsity in 2D DFT domain. A simple algorithm for reconstruction of randomly under-sampled data is proposed. It is based on the analytically determined…

Information Theory · Computer Science 2015-11-17 Srdjan Stankovic , Irena Orovic

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

We consider the problem of recovering a signal $\mathbf{x}^* \in \mathbf{R}^n$, from magnitude-only measurements $y_i = |\left\langle\mathbf{a}_i,\mathbf{x}^*\right\rangle|$ for $i=[m]$. Also called the phase retrieval, this is a…

Machine Learning · Statistics 2017-11-28 Gauri Jagatap , Chinmay Hegde

The problem of phase retrieval is a classic one in optics and arises when one is interested in recovering an unknown signal from the magnitude (intensity) of its Fourier transform. While there have existed quite a few approaches to phase…

Information Theory · Computer Science 2015-10-28 Kishore Jaganathan , Yonina C. Eldar , Babak Hassibi

A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…

Numerical Analysis · Mathematics 2018-10-30 Simon Foucart , Srinivas Subramanian

Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix.…

Information Theory · Computer Science 2013-10-03 Weizhi Lu , Weiyu Li , Kidiyo Kpalma , Joseph Ronsin

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

This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is…

Information Theory · Computer Science 2015-09-07 Jaewook Kang , Hyoyoung Jung , Heung-No Lee , Kiseon Kim

In many practical applications such as direction-of-arrival (DOA) estimation and line spectral estimation, the sparsifying dictionary is usually characterized by a set of unknown parameters in a continuous domain. To apply the conventional…

Information Theory · Computer Science 2015-06-18 Jun Fang , Jing Li , Yanning Shen , Hongbin Li , Shaoqian Li

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

We study the sparse phase retrieval problem, which seeks to recover a sparse signal from a limited set of magnitude-only measurements. In contrast to prevalent sparse phase retrieval algorithms that primarily use first-order methods, we…

Information Theory · Computer Science 2024-03-20 Jian-Feng Cai , Yu Long , Ruixue Wen , Jiaxi Ying

This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse…

Information Theory · Computer Science 2013-09-06 Christoph Studer , Richard G. Baraniuk

This paper investigates the sparse phase retrieval problem, which aims to recover a sparse signal from a system of quadratic measurements. In this work, we propose a novel non-convex algorithm, termed Gradient Hard Thresholding Pursuit…

Numerical Analysis · Mathematics 2025-02-18 Licheng Dai , Xiliang Lu , Juntao You

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope