比快更快:加速 Griffin-Lim 算法
Faster than Fast: Accelerating the Griffin-Lim Algorithm
AI总结:
针对一般相位恢复问题,本文提出 Fast Griffin-Lim 算法(FGLA)的加速版本,提升收敛速度并获得显著更小的极限误差,且通过数值实验与既有算法比较。
摘要:
相位恢复问题出现在工程和应用物理的众多应用领域中。它也是数学、信号处理和机器学习中一个非常活跃的研究领域。本文针对一般情形下的相位恢复问题,提出了著名的 Fast Griffin-Lim 算法(FGLA,快速 Griffin-Lim 算法)的一个加速版本。该版本提高了收敛速度,而且最重要的是,其所生成序列的极限点能够达到比 FGLA 所生成极限点显著更小的误差。我们将给出这一加速的动机,并在数值上将其与其前身以及通常用于求解类似问题的其他算法进行比较。
英文摘要:
The phase retrieval problem is found in various areas of applications of engineering and applied physics. It is also a very active field of research in mathematics, signal processing and machine learning. In this paper, we present an accelerated version of the well known Fast Griffin-Lim algorithm (FGLA) for the phase retrieval problem in a general setting. It has increased the speed of convergence, and most importantly, the limit points of the generated sequence can reach a significantly smaller error than the ones generated by FGLA. We will give a motivation of the acceleration and compare it numerically to its predecessors and other algorithms typically used to solve similar problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。