J Austral Math Soc Ser B 37 pp26--44, 1995.

On Gerchberg's method for the Fourier inverse problem

T. J. Connolly, K. A. Landman and L. R. White

(Received 19 March 1992; revised 16 March 1994)

Abstract

If a finite segment of a spectrum is known, the determination of the finite object function in image space (or the full spectrum in frequency space) is a fundamental problem in image analysis. Gerchberg's method, which solves this problem, can be formulated as a fixed point iteration. This and other related algorithms are shown to be equivalent to a steepest descent method applied to the minimization of an appropriate functional for the Fourier Inversion Problem. Optimal steepest descent and conjugate gradient methods are derived. Numerical results from the application of these techniques are presented. The regularization of the problem and control of noise growth in the iteration are also discussed.

Browse the article

Read the article in your browser. (Print at 75% on A4 paper).

Authors

T. J. Connolly
K. A. Landman
L. R. White
Department of Mathematics, University of Melbourne, Parkville Victoria 3052, Australia.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Mon Dec 10 14:50:05 2001

© Copyright 1997-2004 Australian Mathematical Society