Fienup J R
Appl Opt. 1993 Apr 1;32(10):1737-46. doi: 10.1364/AO.32.001737.
Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradientsearch algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterizationof complicated optical systems from their point spread functions.
已经开发出了相位恢复算法,该算法可处理复杂的光学系统,这种系统需要多次类似菲涅耳变换才能从系统一端传播到另一端,包括多平面孔径的吸收以及对探测器坏像素的考虑。推导了梯度搜索算法和迭代变换相位恢复算法的推广形式。给出了误差度量相对于多项式系数和逐点相位描述的梯度的解析表达式。整个梯度可以用将波前从光学系统一端传播到另一端再返回所需的变换次数来计算,而与系数或相位点的数量无关。这极大地加快了计算速度。还给出了光瞳振幅的重建方法。给出了广义迭代变换算法的收敛性证明。这些改进算法能够根据点扩散函数更准确地表征复杂光学系统。