Reduced computation algorithm for phase retrieval

Norman R. Guivens Jr.; Philip D. Henshaw

doi:10.1117/12.23674

1 November 1990 Reduced computation algorithm for phase retrieval

Norman R. Guivens Jr., Philip D. Henshaw

Proceedings Volume 1351, Digital Image Synthesis and Inverse Optics; (1990) https://doi.org/10.1117/12.23674
Event: 34th Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1990, San Diego, CA, United States

Abstract

Retrieval of the phase of a complex analytic function when only the amplitude is known has application to many real-world problems. For example, phase retrieval has been used in astronomical speckle imaging [1] and is being considered for laser speckle imaging systems.[2,3] In the latter case, the computational requirements may limit the number of images which can be obtained in a given time. This paper describes a modification to the iterative Fourier transform algorithm (IFTA) as described by Fienup [4] which may reduce the computation to reconstruct an image to a given quality by as much as a factor of three.

Citation Download Citation

Norman R. Guivens Jr. and Philip D. Henshaw "Reduced computation algorithm for phase retrieval", Proc. SPIE 1351, Digital Image Synthesis and Inverse Optics, (1 November 1990); https://doi.org/10.1117/12.23674

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available