z-logo
open-access-imgOpen Access
Phase retrieval from Fourier measurements with masks
Author(s) -
Huiping Li,
Li Song
Publication year - 2021
Publication title -
inverse problems and imaging
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.755
H-Index - 40
eISSN - 1930-8345
pISSN - 1930-8337
DOI - 10.3934/ipi.2021028
Subject(s) - combinatorics , dimension (graph theory) , mathematics , physics
This paper concerns the problem of phase retrieval from Fourier measurements with random masks. Here we focus on researching two kinds of random masks. Firstly, we utilize the Fourier measurements with real masks to estimate a general signal \begin{document}$ \mathit{\boldsymbol{x}}_0\in \mathbb{R}^d $\end{document} in noiseless case when \begin{document}$ d $\end{document} is even. It is demonstrated that \begin{document}$ O(\log^2d) $\end{document} real random masks are able to ensure accurate recovery of \begin{document}$ \mathit{\boldsymbol{x}}_0 $\end{document} . Then we find that such real masks are not adaptable to reconstruct complex signals of even dimension. Subsequently, we prove that \begin{document}$ O(\log^4d) $\end{document} complex masks are enough to stably estimate a general signal \begin{document}$ \mathit{\boldsymbol{x}}_0\in \mathbb{C}^d $\end{document} under bounded noise interference, which extends E. Candès et al.'s work. Meanwhile, we establish tighter error estimations for real signals of even dimensions or complex signals of odd dimensions by using \begin{document}$ O(\log^2d) $\end{document} real masks. Finally, we intend to tackle with the noisy phase problem about an \begin{document}$ s $\end{document} -sparse signal by a robust and efficient approach, namely, two-stage algorithm. Based on the stable guarantees for general signals, we show that the \begin{document}$ s $\end{document} -sparse signal \begin{document}$ \mathit{\boldsymbol{x}}_0 $\end{document} can be stably recovered from composite measurements under near-optimal sample complexity up to a \begin{document}$ \log $\end{document} factor, namely, \begin{document}$ O(s\log(\frac{ed}{s})\log^4(s\log(\frac{ed}{s}))) $\end{document}

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here