Phase Retrieval with Background Information: Decreased References and Efficient Methods

by   Ziyang Yuan, et al.

Fourier phase retrieval(PR) is a severely ill-posed inverse problem that arises in various applications. To guarantee a unique solution and relieve the dependence on the initialization, background information can be exploited as a structural priors. However, the requirement for the background information may be challenging when moving to the high-resolution imaging. At the same time, the previously proposed projected gradient descent(PGD) method also demands much background information. In this paper, we present an improved theoretical result about the demand for the background information, along with two Douglas Rachford(DR) based methods. Analytically, we demonstrate that the background required to ensure a unique solution can be decreased by nearly 1/2 for the 2-D signals compared to the 1-D signals. By generalizing the results into d-dimension, we show that the length of the background information more than (2^d+1/d-1) folds of the signal is sufficient to ensure the uniqueness. At the same time, we also analyze the stability and robustness of the model when measurements and background information are corrupted by the noise. Furthermore, two methods called Background Douglas-Rachford (BDR) and Convex Background Douglas-Rachford (CBDR) are proposed. BDR which is a kind of non-convex method is proven to have the local R-linear convergence rate under mild assumptions. Instead, CBDR method uses the techniques of convexification and can be proven to own a global convergence guarantee as long as the background information is sufficient. To support this, a new property called F-RIP is established. We test the performance of the proposed methods through simulations as well as real experimental measurements, and demonstrate that they achieve a higher recovery rate with less background information compared to the PGD method.


page 5

page 8

page 24

page 27

page 28

page 29

page 30

page 31


Phase retrieval with background information

Phase retrieval problem has been studied in various applications. It is ...

Alternating Phase Projected Gradient Descent with Generative Priors for Solving Compressive Phase Retrieval

The classical problem of phase retrieval arises in various signal acquis...

Provable Phase Retrieval with Mirror Descent

In this paper, we consider the problem of phase retrieval, which consist...

Alternating Phase Langevin Sampling with Implicit Denoiser Priors for Phase Retrieval

Phase retrieval is the nonlinear inverse problem of recovering a true si...

Non-Convex Recovery from Phaseless Low-Resolution Blind Deconvolution Measurements using Noisy Masked Patterns

This paper addresses recovery of a kernel h∈ℂ^n and a signal x∈ℂ^n from ...

Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent

This paper studies early-stopped mirror descent applied to noisy sparse ...

Please sign up or login with your details

Forgot password? Click here to reset