phase retrieval

Phase retrieval is the process of algorithmically finding solutions to the phase problem. Given a complex spectrum $F(k)$, of amplitude $, F (k),$, and phase $\psi(k)$:

::$F(k) = , F(k), e^ =\int_^ f(x)\ e^\,dx$

where ''x'' is an ''M''-dimensional spatial coordinate and ''k'' is an ''M''-dimensional spatial frequency coordinate. Phase retrieval consists of finding the phase that satisfies a set of constraints for a measured amplitude. Important applications of phase retrieval include X-ray crystallography, transmission electron microscopy and coherent diffractive imaging, for which $M = 2$. Uniqueness theorems for both 1-D and 2-D cases of the phase retrieval problem, including the phaseless 1-D inverse scattering problem, were proven by Klibanov and his collaborators (see References).

Problem formulation

Here we consider 1-D discrete Fourier transform (DFT) phase retrieval problem. The DFT of a complex signal f /math> is given by

F \sum_^ f e^=, F \cdot e^ \quad k=0,1, \ldots, N-1,

and the oversampled DFT of $x$ is given by

F \sum_^ f e^ \quad k=0,1, \ldots, M-1,

where $M > N$.

Since the DFT operator is bijective, this is equivalent to recovering the phase \psi . It is common recovering a signal from its autocorrelation sequence instead of its Fourier magnitude. That is, denote by $\hat$ the vector $f$ after padding with $N-1$ zeros. The autocorrelation sequence of $\hat$ is then defined as

g \sum_^ \hat_ \overline, \quad m=-(N-1), \ldots, N-1 ,

and the DFT of g , denoted by G , satisfies G , F ^2 .

Methods

Error reduction algorithm

The error reduction is a generalization of the Gerchberg–Saxton algorithm. It solves for $f(x)$ from measurements of $, F(u),$ by iterating a four-step process. For the $k$th iteration the steps are as follows:

Step (1): $G_k(u)$, $\phi_k$, and $g_k(x)$ are estimates of, respectively, $F(u)$, $\psi$ and $f(x)$. In the first step we calculate the Fourier transform of $g_k(x)$:

::$G_k(u) = , G_k(u), e^ = \mathcal (g_k (x)).$

Step (2): The experimental value of $, F(u),$, calculated from the diffraction pattern via the signal equation, is then substituted for $, G_k(u),$, giving an estimate of the Fourier transform:

::$G'_k(u) = , F(u), e^,$

where the ' denotes an intermediate result that will be discarded later on.

Step (3): the estimate of the Fourier transform $G'_k(u)$ is then inverse Fourier transformed:

::$g'_k(x) =, g'_k(x), e^ = \mathcal^(G'_k (u)).$

Step (4): $g'_k (x)$ then must be changed so that the new estimate of the object, $g_ (x)$, satisfies the object constraints. $g_ (x)$ is therefore defined piecewise as:
::$g_ (x) \equiv \begin g'_k(x), & x \notin \gamma, \\ 0, & x \in \gamma, \end$
where $\gamma$ is the domain in which $g'_k (x)$ does not satisfy the object constraints. A new estimate $g_ (x)$ is obtained and the four step process is repeated.

This process is continued until both the Fourier constraint and object constraint are satisfied. Theoretically, the process will always lead to a convergence, but the large number of iterations needed to produce a satisfactory image (generally >2000) results in the error-reduction algorithm by itself being unsuitable for practical applications.

Hybrid input-output algorithm

The hybrid input-output algorithm is a modification of the error-reduction algorithm - the first three stages are identical. However, $g_k(x)$ no longer acts as an estimate of $f(x)$, but the input function corresponding to the output function $g'_k (x)$, which is an estimate of $f(x)$. In the fourth step, when the function $g'_k (x)$ violates the object constraints, the value of $g_(x)$ is forced towards zero, but optimally not to zero. The chief advantage of the hybrid input-output algorithm is that the function $g_k(x)$ contains feedback information concerning previous iterations, reducing the probability of stagnation. It has been shown that the hybrid input-output algorithm converges to a solution significantly faster than the error reduction algorithm. Its convergence rate can be further improved through step size optimization algorithms.

::$g_ (x) \equiv \begin g'_k(x), & x \notin \gamma, \\ g_k (x) - \beta, & x \in \gamma. \end$

Here $\beta$ is a feedback parameter which can take a value between 0 and 1. For most applications, $\beta \approx 0.9$ gives optimal results.

Shrinkwrap

For a two dimensional phase retrieval problem, there is a degeneracy of solutions as $f(x)$ and its conjugate $f^*(-x)$ have the same Fourier modulus. This leads to "image twinning" in which the phase retrieval algorithm stagnates producing an image with features of both the object and its conjugate. The shrinkwrap technique periodically updates the estimate of the support by low-pass filtering the current estimate of the object amplitude (by convolution with a Gaussian) and applying a threshold, leading to a reduction in the image ambiguity.

Semidefinite relaxation-based algorithm for short time Fourier transform

The phase retrieval is an ill-posed problem. To uniquely identify the underlying signal, in addition to the methods that adds additional prior information like Gerchberg–Saxton algorithm, the other way is to add magnitude-only measurements like short time Fourier transform (STFT).

The method introduced below mainly based on the work of Jaganathan ''et al''.

Short time Fourier transform

Given a discrete signal \mathbf=(f f ...,f -1^T which is sampled from $f(x)$. We use a window of length ''W'': \mathbf=(w w ...,w -1^T to compute the STFT of $\mathrm$, denoted by $\mathbf$:

Y ,r\sum_^

for $0\leq m \leq N-1$ and $0\leq r \leq R-1$, where the parameter $L$ denotes the separation in time between adjacent short-time sections and the parameter $R = \left \lceil \frac \right \rceil$ denotes the number of short-time sections considered.

The other interpretation (called sliding window interpretation) of STFT can be used with the help of discrete Fourier transform (DFT). Let w_r w L-n/math> denotes the window element obtained from shifted and flipped window $\mathbf$. Then we have

\mathbf= mathbf_0,\mathbf_1,...,\mathbf_/math>, where $\mathbf_r = \mathbf\circ\mathbf_r$.

Problem definition

Let _ ,r, Y ,r^2 be the $N \times R$ measurements corresponding to the magnitude-square of the STFT of $\mathbf$, $\mathbf_$ be the $N \times N$ diagonal matrix with diagonal elements \left(w_ w_ \ldots, w_ -1right) . STFT phase retrieval can be stated as:

Find $\mathbf$ such that
Z_ , r\left, \left\langle\mathbf_, \mathbf_ \mathbf\right\rangle\^
for $0 \leq m \leq N-1$ and $0 \leq r \leq R-1$, where $\mathbf_$ is the $m$-th column of the $N$-point inverse DFT matrix.

Intuitively, the computational complexity growing with $N$ makes the method impractical. In fact, however, for the most cases in practical we only need to consider the measurements corresponding to $0 \leq m \leq M$, for any parameter $M$ satisfying $2W \leq M \leq N$.

To be more specifically, if both the signal and the window are not ''vanishing'', that is, x \neq 0 for all $0 \leq n \leq N-1$ and w \neq 0 for all $0 \leq$ $n \leq W-1$, signal $\mathbf$ can be uniquely identified from its STFT magnitude if the following requirements are satisfied:

# $L < W \leq N/2$,
# $2W \leq M \leq N$.

The proof can be found in Jaganathan' s work, which reformulates STFT phase retrieval as the following least-squares problem:

\min _ \sum_^ \sum_^\left(Z_ , r\left, \left\langle\mathbf_, \mathbf_ \mathbf\right\rangle\^\right)^.

The algorithm, although without theoretical recovery guarantees, empirically able to converge to the global minimum when there is substantial overlap between adjacent short-time sections.

Semidefinite relaxation-based algorithm

To establish recovery guarantees, one way is to formulate the problems as a semidefinite program (SDP), by embedding the problem in a higher dimensional space using the transformation $\mathbf=\mathbf\mathbf^\ast$ and relax the rank-one constraint to obtain a convex program. The problem reformulated is stated below:

Obtain $\mathbf$ by solving:\begin
&\mathrm~~~\mathrm(\mathbf)\\ pt&\mathrm~~Z ,r\mathrm(\mathbf_r^\mathbf_m\mathbf_m^\ast\mathbf_r\mathbf)\\ pt&~~~~~~~~~~~~~~~~~~~\mathbf\succeq0
\endfor $1 \leq m \leq M$ and $0 \leq r \leq R-1$

Once $\mathbf$ is found, we can recover signal $\mathbf$ by best rank-one approximation.

Applications

Phase retrieval is a key component of coherent diffraction imaging (CDI). In CDI, the intensity of the diffraction pattern scattered from a target is measured. The phase of the diffraction pattern is then obtained using phase retrieval algorithms and an image of the target is constructed. In this way, phase retrieval allows for the conversion of a diffraction pattern into an image without an optical lens.

Using phase retrieval algorithms, it is possible to characterize complex optical systems and their aberrations. For example, phase retrieval was used to diagnose and repair the flawed optics of the Hubble Space Telescope.

Other applications of phase retrieval include X-ray crystallography and transmission electron microscopy.

See also

* Phase problem
* Crystallography
* X-ray crystallography
* Coherent diffraction imaging
* Transport-of-Intensity Equation
* Phase correlation

References

*
*
*
*
*
*
*
*{{cite journal, author=Klibanov, M. V., journal=J. Math. Anal. Appl., year=2006, volume=323, issue=2, pages=818–843, title=On the recovery of a 2-D function from the modulus of its Fourier transform, doi=10.1016/j.jmaa.2005.10.079, doi-access=free

Crystallography
Mathematical physics
Mathematical chemistry
Inverse problems