Contents
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 this phase the Adaptive-Additive Algorithm (or AA algorithm), which derives from a group of adaptive (input-output) algorithms, can be used. The AA algorithm is an iterative algorithm that utilizes the Fourier Transform to calculate an unknown part of a propagating wave, normally the spatial frequency phase (k space). This can be done when given the phase’s known counterparts, usually an observed amplitude (position space) and an assumed starting amplitude (k space). To find the correct phase the algorithm uses error conversion, or the error between the desired and the theoretical intensities.
The algorithm
History
The adaptive-additive algorithm was originally created to reconstruct the spatial frequency phase of light intensity in the study of stellar interferometry. Since then, the AA algorithm has been adapted to work in the fields of Fourier Optics by Soifer and Dr. Hill, soft matter and optical tweezers by Dr. Grier, and sound synthesis by Röbel.
Algorithm
Example
For the problem of reconstructing the spatial frequency phase (k-space) for a desired intensity in the image plane (x-space). Assume the amplitude and the starting phase of the wave in k-space is A_0 and \phi_n^{k} respectively. Fourier transform the wave in k-space to x space. Then compare the transformed intensity I_n^f with the desired intensity I_0^f, where Check \varepsilon against the convergence requirements. If the requirements are not met then mix the transformed amplitude A_n^f with desired amplitude A^f. where a is mixing ratio and Note that a is a percentage, defined on the interval 0 ≤ a ≤ 1. Combine mixed amplitude with the x-space phase and inverse Fourier transform. Separate \bar{A}_n^k and \phi^k_n and combine A_0 with \phi^k_n. Increase loop by one n \to n + 1 and repeat.
Limits
This article is derived from Wikipedia and licensed under CC BY-SA 4.0. View the original article.
Wikipedia® is a registered trademark of the
Wikimedia Foundation, Inc.
Bliptext is not
affiliated with or endorsed by Wikipedia or the
Wikimedia Foundation.