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.
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.