Jump to content

Phase retrieval: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
He to Hecuba (talk | contribs)
not a stub
He to Hecuba (talk | contribs)
Line 58: Line 58:


[[Category:Crystallography]]
[[Category:Crystallography]]
[[Category:Mathematical physics]]
[[Category:Mathematical chemistry]]


[[pt:Recuperação de fase]]
[[pt:Recuperação de fase]]

Revision as of 12:27, 18 February 2012

Phase retrieval is the process of algorithmically finding solutions to the phase problem. Given a complex signal , of amplitude , and phase :

where x is an M-dimensional spatial coordinate and k is an M-dimensional spatial frequency coordinate, phase retrieval consists in finding the phase that for a measured amplitude satisfies a set of constraints. Important applications of phase retrieval include X-ray crystallography, transmission electron microscopy and coherent diffractive imaging, for which . (Fineup 1982:2759)

Methods

Error reduction algorithm

Schematic view of the error reduction algorithm for phase retrieval

The error reduction or Gerchberg-Saxton algorithm solves the signal equation for by the iteration of a four-step process. In the first step, an estimate of the object , undergoes Fourier transformation:

The experimental value of , calculated from the diffraction pattern via the signal equation, is then substituted for , giving an estimate of the Fourier transformation:

Next, the estimate of the Fourier transformation is inverse Fourier transformed:

then must be changed so that the new estimate of the object, satisfies the object constraints. is therefore defined piecewise as:

where is the domain in which does not satisfy the object constraints. As the calculated image, , is complex valued, is replaced by the experimental value of , to give the new estimate of the object. (Fienup and Wackerman, 1986:1899)

This process is continued until both the Fourier constraint and object constraint are satisfied. Theoretically, the process will always lead to a convergence (Fineup 1982:2761), but the large number of iterations needed to produce a satisfactory image (generally >2000) results in the error-reduction algorithm being unsuitably inefficient for sole use in 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, no longer acts as an estimate of , but the input function corresponding to the output function , which is an estimate of (Fienup 1982:2762). In the fourth step, when the function violates the object constraints, the value of is forced towards zero, but optimally not to zero. The chief advantage of the hybrid input-output algorithm is that the function contains feedback information concerning previous iterations, reducing the probability of stagnation.

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

Shrinkwrap

For a two dimensional phase retrieval problem, there is a degeneracy of solutions as and its conjugate 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. In the shrinkwrap technique the object support constraint is repeatedly convolved with a Gaussian and thresholded, leading to a reduction in the image ambiguity. (Fineup and Wackerman, 1986:1900)

References

  • Fienup, J.R. (1 August 1982). "Phase retrieval algorithms: a comparison" (PDF). Applied Optics. 21 (15): 2758–2769.{{cite journal}}: CS1 maint: date and year (link)
  • Fienup, J. R. and Wackerman, C.C. (3 July 1986). "Phase-retrieval stagnation problems and solutions" (PDF). Journal of the Optical Society of America. 3 (11): 1897–1907.{{cite journal}}: CS1 maint: multiple names: authors list (link)

See also