scispace - formally typeset
Search or ask a question
Journal Article

A practical algorithm for the determination of phase from image and diffraction plane pictures

01 Jan 1972-Optik-Vol. 35, Iss: 2, pp 237-246
TL;DR: In this article, an algorithm is presented for the rapid solution of the phase of the complete wave function whose intensity in the diffraction and imaging planes of an imaging system are known.
About: This article is published in Optik.The article was published on 1972-01-01 and is currently open access. It has received 5197 citations till now. The article focuses on the topics: Gerchberg–Saxton algorithm & Phase retrieval.
Citations
More filters
Journal ArticleDOI
TL;DR: Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods and it is shown that both the error-reduction algorithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm forThe problem of two intensity measurements converge.
Abstract: Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sensing) and the problem of phase retrieval from a single intensity measurement plus a non-negativity constraint (in astronomy) are considered, with emphasis on the latter. It is shown that both the error-reduction algorithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm for the problem of two intensity measurements converge. The error-reduction algorithm is also shown to be closely related to the steepest-descent method. Other algorithms, including the input-output algorithm and the conjugate-gradient method, are shown to converge in practice much faster than the error-reduction algorithm. Examples are shown.

5,210 citations

Journal ArticleDOI
TL;DR: In this paper, it was shown that if every polarization vector rotates, the light has spin; if the phase structure rotates and if a light has orbital angular momentum (OAM), the light can be many times greater than the spin.
Abstract: As they travel through space, some light beams rotate. Such light beams have angular momentum. There are two particularly important ways in which a light beam can rotate: if every polarization vector rotates, the light has spin; if the phase structure rotates, the light has orbital angular momentum (OAM), which can be many times greater than the spin. Only in the past 20 years has it been realized that beams carrying OAM, which have an optical vortex along the axis, can be easily made in the laboratory. These light beams are able to spin microscopic objects, give rise to rotational frequency shifts, create new forms of imaging systems, and behave within nonlinear material to give new insights into quantum optics.

2,508 citations

Journal ArticleDOI
TL;DR: The design of the hologram integrates a ground metal plane with a geometric metasurface that enhances the conversion efficiency between the two circular polarization states, leading to high diffraction efficiency without complicating the fabrication process.
Abstract: Using a metasurface comprising an array of nanorods with different orientations and a backreflector, a hologram image can be obtained in the visible and near-infrared with limited loss of light intensity.

2,075 citations

Journal ArticleDOI
TL;DR: An algorithm to estimate a signal from its modified short-time Fourier transform (STFT) by minimizing the mean squared error between the STFT of the estimated signal and the modified STFT magnitude is presented.
Abstract: In this paper, we present an algorithm to estimate a signal from its modified short-time Fourier transform (STFT). This algorithm is computationally simple and is obtained by minimizing the mean squared error between the STFT of the estimated signal and the modified STFT. Using this algorithm, we also develop an iterative algorithm to estimate a signal from its modified STFT magnitude. The iterative algorithm is shown to decrease, in each iteration, the mean squared error between the STFT magnitude of the estimated signal and the modified STFT magnitude. The major computation involved in the iterative algorithm is the discrete Fourier transform (DFT) computation, and the algorithm appears to be real-time implementable with current hardware technology. The algorithm developed in this paper has been applied to the time-scale modification of speech. The resulting system generates very high-quality speech, and appears to be better in performance than any existing method.

1,899 citations

Journal ArticleDOI
01 May 1981
TL;DR: Specific conditions under which a sequence can be exactly reconstructed from phase are reviewed, both for one-dimensional and multi-dimensional sequences, and algorithms for both approximate and exact reconstruction of signals from phase information are presented.
Abstract: In the Fourier representation of signals, spectral magnitude and phase tend to play different roles and in some situations many of the important features of a signal are preserved if only the phase is retained. Furthermore, under a variety of conditions, such as when a signal is of finite length, phase information alone is sufficient to completely reconstruct a signal to within a scale factor. In this paper, we review and discuss these observations and results in a number of different contexts and applications. Specifically, the intelligibility of phase-only reconstruction for images, speech, and crystallographic structures are illustrated. Several approaches to justifying the relative importance of phase through statistical arguments are presented, along with a number of informal arguments suggesting reasons for the importance of phase. Specific conditions under which a sequence can be exactly reconstructed from phase are reviewed, both for one-dimensional and multi-dimensional sequences, and algorithms for both approximate and exact reconstruction of signals from phase information are presented. A number of applications of the observations and results in this paper are suggested.

1,850 citations