Subspace Phase Retrieval

06/06/2022
by   Mengchu Xu, et al.
0

In this paper, we propose a novel algorithm, termed Subspace Phase Retrieval (SPR), which can accurately recover any n-dimensional k-sparse signal from 𝒪(klog n) magnitude-only Gaussian samples. This offers a significant improvement over some existing results that require 𝒪(k^2 log n) samples. We also present a geometrical analysis for a subproblem, where we recover the sparse signal given that at least one support index of this signal is identified already. It is shown that with high probability, 𝒪(klog k) magnitude-only Gaussian samples ensure i) that all local minima of our objective function are clustered around the expected global minimum within arbitrarily small distances, and ii) that all critical points outside of this region have at least one negative curvature. When the input signal is nonsparse (i.e., k = n), our result indicates an analogous geometric property with 𝒪(n log n) samples. This affirmatively answers the open question by Sun-Qu-Wright [1].

READ FULL TEXT

page 2

page 3

page 4

page 6

page 7

page 9

page 10

page 16

research
04/20/2022

Nearly optimal bounds for the global geometric landscape of phase retrieval

The phase retrieval problem is concerned with recovering an unknown sign...
research
02/22/2016

A Geometric Analysis of Phase Retrieval

Can we recover a complex signal from its Fourier magnitudes? More genera...
research
12/15/2021

The global landscape of phase retrieval I: perturbed amplitude models

A fundamental task in phase retrieval is to recover an unknown signal ∈ ...
research
12/15/2021

The global landscape of phase retrieval II: quotient intensity models

A fundamental problem in phase retrieval is to reconstruct an unknown si...
research
08/06/2018

Super Resolution Phase Retrieval for Sparse Signals

In a variety of fields, in particular those involving imaging and optics...
research
01/27/2022

Phase Retrieval for Radar Waveform Design

The ability of a radar to discriminate in both range and Doppler velocit...
research
06/04/2023

Sparse Convolution for Approximate Sparse Instance

Computing the convolution A ⋆ B of two vectors of dimension n is one of ...

Please sign up or login with your details

Forgot password? Click here to reset