Physics – Optics
Scientific paper
Nov 1990
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1990spie.1351..661g&link_type=abstract
IN: Digital image synthesis and inverse optics; Proceedings of the Meeting, San Diego, CA, July 9-13, 1990 (A92-18776 05-74). Be
Physics
Optics
Algorithms, Computer Techniques, Fourier Transformation, Image Reconstruction, Run Time (Computers), Iterative Solution, Power Spectra, Speckle Holography, Spectral Resolution
Scientific paper
A modification to the iterative Fourier transform algorithm as described by Fienup (1982), which may reduce the computation to reconstruct an image to a given quality by as much as a factor of three, is presented. The concept of this reduced computation algorithm is based on three simple ideas: (1) by starting with an initial guess closer to the answer, fewer iterations are necessary; (2) smaller FFT's need much less computation than large FFT's; and (3) a good initial guess for performing phase retrieval at any image size can be realized by performing phase retrieval at a smaller image size and subdividing the pixels of the smaller reconstructed image. The phase retrieval process is shown schematically, starting with a four-by-four image, and successively doubling the number of pixels at each larger image size. Results shown are actual images reconstructed from a noise-free power spectral density using this procedure.
Guivens Norman R. Jr.
Henshaw Philip D.
No associations
LandOfFree
Reduced computation algorithm for phase retrieval does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reduced computation algorithm for phase retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced computation algorithm for phase retrieval will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-845985