English
Related papers

Related papers: Phase Retrieval for Sparse Signals

200 papers

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

The goal of phaseless compressed sensing is to recover an unknown sparse or approximately sparse signal from the magnitude of its measurements. However, it does not take advantage of any support information of the original signal.…

Information Theory · Computer Science 2022-05-18 Haiye Huo

We study the recovery conditions of weighted $\ell_1$ minimization for real-valued signal reconstruction from phaseless compressive sensing measurements when partial support information is available. A strong restricted isometry property…

Information Theory · Computer Science 2017-12-14 Zhiyong Zhou , Jun Yu

This work considers recovery of signals that are sparse over two bases. For instance, a signal might be sparse in both time and frequency, or a matrix can be low rank and sparse simultaneously. To facilitate recovery, we consider minimizing…

Information Theory · Computer Science 2012-02-17 Samet Oymak , Babak Hassibi

We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery…

Information Theory · Computer Science 2014-12-05 Hassan Mansour , Rayan Saab

Affine phase retrieval is the problem of recovering signals from the magnitude-only measurements with a priori information. In this paper, we use the $\ell_1$ minimization to exploit the sparsity of signals for affine phase retrieval,…

Information Theory · Computer Science 2022-09-20 Meng Huang , Shixiang Sun , Zhiqiang Xu

The aim of this paper is to study the stability of the $\ell_1$ minimization for the compressive phase retrieval and to extend the instance-optimality in compressed sensing to the real phase retrieval setting. We first show that the…

Functional Analysis · Mathematics 2016-01-12 Bing Gao , Yang Wang , Zhiqiang Xu

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

Information Theory · Computer Science 2019-09-18 Jan-Hendrik Lange , Marc E. Pfetsch , Bianca M. Seib , Andreas M. Tillmann

In many areas of imaging science, it is difficult to measure the phase of linear measurements. As such, one often wishes to reconstruct a signal from intensity measurements, that is, perform phase retrieval. In several applications the…

Information Theory · Computer Science 2015-06-16 Afonso S. Bandeira , Dustin G. Mixon

Compressed sensing shows that a sparse signal can stably be recovered from incomplete linear measurements. But, in practical applications, some signals have additional structure, where the nonzero elements arise in some blocks. We call such…

Information Theory · Computer Science 2023-11-29 Jianwen Huang , Hailin Wang , Feng Zhang , Jianjun Wang , Jinping Jia

We propose novel necessary and sufficient conditions for a sensing matrix to be "$s$-good" - to allow for exact $\ell_1$-recovery of sparse signals with $s$ nonzero entries when no measurement noise is present. Then we express the error…

Optimization and Control · Mathematics 2014-04-11 Anatoli Juditsky , Arkadii S. Nemirovski

We consider the problem of recovering signals from their power spectral density. This is a classical problem referred to in literature as the phase retrieval problem, and is of paramount importance in many fields of applied sciences. In…

Information Theory · Computer Science 2013-11-12 Kishore Jaganathan , Samet Oymak , Babak Hassibi

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2011-11-08 M. Amin Khajehnejad , Weiyu Xu , A. Salman Avestimehr , Babak Hassibi

This article considers constrained $\ell_1$ minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise…

Machine Learning · Computer Science 2008-05-05 T. Tony Cai , Guangwu Xu , Jun Zhang

Phase retrieval is to recover the signals from phaseless measurements which is raised in many areas. A fundamental problem in phase retrieval is to determine the minimal measurement number $m$ so that one can recover $d$-dimensional signals…

Information Theory · Computer Science 2017-07-06 Zhiqiang Xu

This paper provides novel results for the recovery of signals from undersampled measurements based on analysis $\ell_1$-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery…

Information Theory · Computer Science 2014-11-04 Holger Rauhut , Maryia Kabanava

Dictionary-sparse phase retrieval, which is also known as phase retrieval with redundant dictionary, aims to reconstruct an original dictionary-sparse signal from its measurements without phase information. It is proved that if the…

Information Theory · Computer Science 2025-06-05 Lianxing Xia , Haiye Huo

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2010-04-06 M. Amin Khajehnejad , Weiyu Xu , Salman Avestimehr , Babak Hassibi

Sparse phase retrieval aims to recover a $k$-sparse signal from $m$ phaseless measurements. While the theoretically optimal sample complexity for successful recovery is $\Omega(k \log n)$, existing algorithms can only achieve this bound for…

Information Theory · Computer Science 2026-03-30 Mengchu Xu , Yuxuan Zhang , Jian Wang

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
‹ Prev 1 2 3 10 Next ›