Abstract
The problem of retrieving a complex function when both its square modulus and the square modulus of its Fourier transform are known is considered. When these intensities are directly assumed to be data, it amounts to performing the inversion of a quadratic operator. The solution is found to be the global minimum of an appropriate functional. Moreover, inasmuch as the unknown function is modeled within a finite-dimensional set, the data are also consistently represented within finite-dimensional subspaces, and a coherent discretization of the problem results. Because the assumed formulation involves nonquadratic functionals, the crucial problem of the existence of local minima in the course of the minimization procedure is discussed. The main factors affecting these minima can be identified, such as the amount of available independent data. Furthermore, quadraticity makes it possible to define an efficient conjugate-gradient-based minimization procedure. The numerical results confirm the distinguishing feature of the proposed approach—its ability to obtain the solution starting from a completely random guess.
© 1996 Optical Society of America
Full Article | PDF ArticleMore Like This
Tommaso Isernia, Giovanni Leone, Rocco Pierri, and Francesco Soldovieri
J. Opt. Soc. Am. A 16(7) 1845-1856 (1999)
T. Isernia, V. Pascazio, R. Pierri, and G. Schirinzi
J. Opt. Soc. Am. A 13(5) 922-934 (1996)
B. R. Hunt, T. L. Overman, and Peter Gough
Opt. Lett. 23(14) 1123-1125 (1998)