Key points are not available for this paper at this time.
We apply the method of alternating projections onto convex sets to the problem of restoring a signal from the phase of its Fourier transform. A method of improving convergence by adaptively varying a set of relaxation parameters in the restoration algorithm is described. The advantages of using the method of convex projections over other iterative restoration algorithms are discussed and illustrated.
Levi et al. (Wed,) studied this question.