Iterative multiresolution algorithm for image reconstruction from the magnitude of its Fourier transform

  • Rabadi W
6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Iterative algorithms are currently the most effective approaches to solving a number of difficult signal reconstruction and recovery problems, and all of these algorithms suffer from stagnation and computational complexity. We propose a new multiresolution iterative approach that employs the concept of a multiresolution pyramid. This method attempts to solve the problem of image reconstruction from the measurement of the image's Fourier modulus by decomposing the problem onto different resolution grids, which enables the iterative algorithm to avoid stagnation by providing a better initial guess and enabling a higher likelihood of arriving at a global minimum while dramatically reducing the computational cost. Results on both synthetic and real-world images are shown; a performance comparison with the direct iterative algorithm demonstrates the effectiveness of our approach in terms of convergence, robustness and computational efficiency. © 1996 Society of Photo-Optical Instrumentation Engineers.

Cite

CITATION STYLE

APA

Rabadi, W. A. (1996). Iterative multiresolution algorithm for image reconstruction from the magnitude of its Fourier transform. Optical Engineering, 35(4), 1015. https://doi.org/10.1117/1.600718

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free