Affine phase retrieval for sparse signals via ℓ_1 minimization

09/19/2022
by   Meng Huang, et al.
0

Affine phase retrieval is the problem of recovering signals from the magnitude-only measurements with a priori information. In this paper, we use the ℓ_1 minimization to exploit the sparsity of signals for affine phase retrieval, showing that O(klog(en/k)) Gaussian random measurements are sufficient to recover all k-sparse signals by solving a natural ℓ_1 minimization program, where n is the dimension of signals. For the case where measurements are corrupted by noises, the reconstruction error bounds are given for both real-valued and complex-valued signals. Our results demonstrate that the natural ℓ_1 minimization program for affine phase retrieval is stable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2018

Phase retrieval from the magnitudes of affine measurements

In this paper, we consider the generalized phase retrieval from affine m...
research
01/17/2018

Stable Phaseless Sampling and Reconstruction of Real-Valued Signals with Finite Rate of Innovations

A spatial signal is defined by its evaluations on the whole domain. In t...
research
05/23/2017

Multiple Images Recovery Using a Single Affine Transformation

In many real-world applications, image data often come with noises, corr...
research
09/04/2019

Phase retrieval of complex and vector-valued functions

The phase retrieval problem in the classical setting is to reconstruct r...
research
06/19/2019

Complex phase retrieval from subgaussian measurements

Phase retrieval refers to the problem of reconstructing an unknown vecto...
research
02/06/2016

DOLPHIn - Dictionary Learning for Phase Retrieval

We propose a new algorithm to learn a dictionary for reconstructing and ...
research
06/21/2020

Stable Phase Retrieval from Locally Stable and Conditionally Connected Measurements

This paper is concerned with stable phase retrieval for a family of phas...

Please sign up or login with your details

Forgot password? Click here to reset