English
Related papers

Related papers: Subspace Phase Retrieval

200 papers

Sparse phase retrieval plays an important role in many fields of applied science and thus attracts lots of attention. In this paper, we propose a \underline{sto}chastic alte\underline{r}nating \underline{m}inimizing method for…

Machine Learning · Statistics 2019-06-17 Jianfeng Cai , Yuling Jiao , Xiliang Lu , Juntao You

Phase retrieval arises in various fields of science and engineering and it is well studied in a finite-dimensional setting. In this paper, we consider an infinite-dimensional phase retrieval problem to reconstruct real-valued signals living…

Information Theory · Computer Science 2016-03-07 Yang Chen , Cheng Cheng , Qiyu Sun , Haichao Wang

In this short note we propose a simple two-stage sparse phase retrieval strategy that uses a near-optimal number of measurements, and is both computationally efficient and robust to measurement noise. In addition, the proposed strategy is…

Numerical Analysis · Mathematics 2015-04-27 Mark Iwen , Aditya Viswanathan , Yang Wang

We consider the phase retrieval problem for signals that belong to a union of subspaces. We assume that amplitude measurements of the signal of length $n$ are observed after passing it through a random $m \times n$ measurement matrix. We…

Information Theory · Computer Science 2018-07-18 M. Salman Asif , Chinmay Hegde

We consider the problem of high-dimensional misspecified phase retrieval. This is where we have an $s$-sparse signal vector $\mathbf{x}_*$ in $\mathbb{R}^n$, which we wish to recover using sampling vectors…

Information Theory · Computer Science 2017-12-14 Yan Shuo Tan

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 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

In phase retrieval, the goal is to recover a complex signal from the magnitude of its linear measurements. While many well-known algorithms guarantee deterministic recovery of the unknown signal using i.i.d. random measurement matrices,…

Information Theory · Computer Science 2017-03-24 Boshra Rajaei , Sylvain Gigan , Florent Krzakala , Laurent Daudet

The aim of this paper is to build up the theoretical framework for the recovery of sparse signals from the magnitude of the measurement. We first investigate the minimal number of measurements for the success of the recovery of sparse…

Information Theory · Computer Science 2013-10-07 Yang Wang , Zhiqiang Xu

Phase retrieval refers to a classical nonconvex problem of recovering a signal from its Fourier magnitude measurements. Inspired by the compressed sensing technique, signal sparsity is exploited in recent studies of phase retrieval to…

Computational Physics · Physics 2013-02-04 Zai Yang , Cishen Zhang , Lihua Xie

Phase retrieval (PR) is an inverse problem about recovering a signal from phaseless linear measurements. This problem can be effectively solved by minimizing a nonconvex amplitude-based loss function. However, this loss function is…

Signal Processing · Electrical Eng. & Systems 2020-07-24 Q. Luo , H. Wang

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

In this paper, we study the sample complexity and develop efficient optimal algorithms for 1-bit phase retrieval: recovering a signal $\mathbf{x}\in\mathbb{R}^n$ from $m$ phaseless bits…

Information Theory · Computer Science 2025-12-18 Junren Chen , Ming Yuan

In the compressive phase retrieval problem, or phaseless compressed sensing, or compressed sensing from intensity only measurements, the goal is to reconstruct a sparse or approximately $k$-sparse vector $x \in \mathbb{R}^n$ given access to…

Data Structures and Algorithms · Computer Science 2020-03-03 Yi Li , Vasileios Nakos

This paper addresses the problem of sparse phase retrieval, a fundamental inverse problem in applied mathematics, physics, and engineering, where a signal need to be reconstructed using only the magnitude of its transformation while phase…

Machine Learning · Statistics 2025-04-15 The Tien Mai

We study the sparse phase retrieval problem, recovering an $s$-sparse length-$n$ signal from $m$ magnitude-only measurements. Two-stage non-convex approaches have drawn much attention in recent studies for this problem. Despite…

Information Theory · Computer Science 2023-06-21 Jian-Feng Cai , Jingyang Li , Juntao You

In this paper, we tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, $x\in \mathbb{C}^n$, from the magnitudes of m linear measurements, $y=|Ax|$, where $A \in…

Information Theory · Computer Science 2015-02-18 Ramtin Pedarsani , Kangwook Lee , Kannan Ramchandran

This contribution proposes a two stage strategy to allow for phase retrieval in state of the art sub-Nyquist sampling schemes for sparse multiband signals. The proposed strategy is based on data acquisition via modulated wideband converters…

Information Theory · Computer Science 2015-09-29 Çağkan Yapar , Volker Pohl , Holger Boche

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

In the problem of compressive phase retrieval, one wants to recover an approximately $k$-sparse signal $x \in \mathbb{C}^n$, given the magnitudes of the entries of $\Phi x$, where $\Phi \in \mathbb{C}^{m \times n}$. This problem has…

Information Theory · Computer Science 2020-02-19 Vasileios Nakos