Gerchberg–Saxton algorithm

Gerchberg–Saxton algorithm

The Gerchberg-Saxton (GS) algorithm is an iterative algorithm for retrieving the phase of a pair of light distributions (or any other mathematically valid distribution) related via a propagating function, such as the Fourier transform, if their intensities at their respective optical planes are known.

It is often necessary to know only the phase distribution from one of the planes, since the phase distribution on the other plane can be obtained by performing a Fourier transform on the plane whose phase is known. Although often used for two-dimensional signals, the GS algorithm is also valid for one-dimensional signals.

The paper by R. W. Gerchberg and W. O. Saxton on this algorithm is entitled “A practical algorithm for the determination of the phase from image and diffraction plane pictures,” and was published in "Optik" (35, 237–246 1972).

The Pseudo-code below performs the GS algorithm to obtain a phase distribution for the plane, Source, such that its Fourier transform would have the amplitude distribution of the plane, Target.

Pseudo-code algorithm

Let: FT - Forward Fourier Transform IFT - Inverse Fourier Transform i - the imaginary number, sqrt(-1) (square root of -1) exp - exponential function (e^x) Target and Source be the Target and Source Amplitude planes respectively A, B, C & D be complex planes with the same dimension as Target and Source Amplitude - Amplitde extracting function: eg. for complex z = x + iy, Amplitude(z) = sqrt(x*x + y*y) for real x, Amplitude(x) = |x
Phase - Phase extracting function: eg. Phase(z) = arctan(y/x) end Let

Gerchberg–Saxton Algorithm(Source, Target, Retrieved_Phase) A = IFT(Target) while error criterion is not satified B = Amplitude(Source) * exp(i*Phase(A)) C = FT(B) D = Amplitude(Target) * exp(i*Phase(C)) A = IFT(D) end while Retrieved_Phase = Phase(A) end Gerchberg–Saxton Algorithm

This is just one of the many ways to implement the GS algorithm. Aside from optimizations, others may start by performing a forward Fourier Transform to the source distribution.

ee also

* Fourier optics
* Holography
* Adaptive-additive algorithm

References

# "Smilie Face Hologram - K. Ardnt, C. Byers, G. Donald, S. McKernan, C. Wilson; University of Glasgow, (2006)

External links

* [http://www.ysbl.york.ac.uk/~cowtan/fourier/coeff.html Graphical explanatory material by Kevin Cowtan]
* [http://www-hrem.msm.cam.ac.uk/people/saxton/ Dr W. Owen Saxton's page]
* [http://www.optics.rochester.edu/workgroups/fienup/index.html Applications and publications on phase retrieval from the University of Rochester, Institute of Optics]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Adaptive-additive algorithm — In the studies of Fourier optics, sound synthesis, stellar interferometry, optical tweezers, and diffractive optical elements (DOEs) it is often important to know the spatial frequency phase of an observed wave source. In order to reconstruct… …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • Defocus aberration — A photograph of Christmas lights with significant defocus aberration. v · d …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”