The recovery of complex sparse signals from few phaseless measurements

11/26/2019
by   Yu Xia, et al.
0

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 ℓ_1 minimization to stably recover complex k-sparse signals from m≥ O(klog (n/k)) complex Gaussian random quadratic measurements with high probability. To do that, we establish that Gaussian random measurements satisfy the restricted isometry property over rank-2 and sparse matrices with high probability. This paper presents the first theoretical estimation of the measurement number for stably recovering complex sparse signals from complex Gaussian quadratic measurements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2022

A Unified Recovery of Structured Signals Using Atomic Norm

In many applications we seek to recover signals from linear measurements...
research
06/20/2019

Universality in Learning from Linear Measurements

We study the problem of recovering a structured signal from independentl...
research
02/14/2019

Solving Complex Quadratic Systems with Full-Rank Random Matrices

We tackle the problem of recovering a complex signal x∈C^n from quadrat...
research
07/23/2018

Batch Sparse Recovery, or How to Leverage the Average Sparsity

We introduce a batch version of sparse recovery, where the goal is to re...
research
06/04/2019

Tensor Restricted Isometry Property Analysis For a Large Class of Random Measurement Ensembles

In previous work, theoretical analysis based on the tensor Restricted Is...
research
02/04/2020

On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems

We consider the problem of recovering a complex vector x∈C^n from m quad...
research
04/16/2015

Multichannel sparse recovery of complex-valued signals using Huber's criterion

In this paper, we generalize Huber's criterion to multichannel sparse re...

Please sign up or login with your details

Forgot password? Click here to reset