基于平滑梯度的频率分辨光选通恢复
Frequency-Resolved Optical Gating Recovery via Smoothing Gradient
摘要:
频率分辨光门(FROG)是一种用于超短激光脉冲全特性分析的常用技术。在FROG中获得的数据,称为FROG轨迹,是未知脉冲与其自身的时移版本的乘积的傅立叶幅度,对于几个不同的移位。为了从FROG轨迹中估计脉冲,我们提出了一种最小化平滑非凸最小二乘目标函数的算法。该方法包括两个步骤。首先,我们近似的脉冲迭代谱算法。然后,所获得的初始化细化的基础上的一系列块随机梯度迭代。该算法理论上简单,数值可扩展,易于实现。从经验上讲,我们的方法优于国家的最先进的青蛙跟踪时,是不完整的,也就是说,当只有几个移位记录。模拟还表明,该算法表现出类似的计算成本相比,一个国家的最先进的技术,完整和不完整的数据。此外,我们证明了在真解附近,算法收敛到一个临界点。Matlab实现在https://github.com/samuelpinilla/FROG上公开提供。
英文摘要:
Frequency-resolved optical gating (FROG) is a popular technique for complete characterization of ultrashort laser pulses. The acquired data in FROG, called FROG trace, is the Fourier magnitude of the product of the unknown pulse with a time-shifted version of itself, for several different shifts. To estimate the pulse from the FROG trace, we propose an algorithm that minimizes a smoothed non-convex least-squares objective function. The method consists of two steps. First, we approximate the pulse by an iterative spectral algorithm. Then, the attained initialization is refined based upon a sequence of block stochastic gradient iterations. The algorithm is theoretically simple, numerically scalable, and easy-to-implement. Empirically, our approach outperforms the state-of-the-art when the FROG trace is incomplete, that is, when only few shifts are recorded. Simulations also suggest that the proposed algorithm exhibits similar computational cost compared to a state-of-the-art technique for both complete and incomplete data. In addition, we prove that in the vicinity of the true solution, the algorithm converges to a critical point. A Matlab implementation is publicly available at https://github.com/samuelpinilla/FROG.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。