arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.00399cs.ITmath.ITphysics.data-an
收藏

相位恢复的基准问题

Benchmark problems for phase retrieval

Veit Elser, Ti-Yen Lan, Tamir Bendory

摘要:

近年来,相位恢复问题的数学和算法方面受到了相当大的关注。这一领域的许多论文都提到晶体学是其主要应用。在晶体学中,要恢复的信号是周期性的,并且由在晶体的晶胞中均匀排列的原子分布组成。晶体学问题是相位恢复的主要应用,也是最困难的形式之一。我们已经构建了一个分级的基准问题的评估算法,执行这种类型的相位检索。这些数据在网上公开,以易于解释的格式提供。我们还提出了一个简单而明确的成功/失败的标准,根据晶体学的实际需要。基线运行时间是用迭代算法获得的,该算法与晶体学中使用的算法相似但更透明。根据经验,运行时间相对于一个新的硬度参数呈指数增长:信号自相关的稀疏性。我们还回顾了领先的软件包所使用的算法。我们希望,这一组基准问题,将鼓励发展新的算法的相位恢复问题,特别是晶体学。

英文摘要:

In recent years, the mathematical and algorithmic aspects of the phase retrieval problem have received considerable attention. Many papers in this area mention crystallography as a principal application. In crystallography, the signal to be recovered is periodic and comprised of atomic distributions arranged homogeneously in the unit cell of the crystal. The crystallographic problem is both the leading application and one of the hardest forms of phase retrieval. We have constructed a graded set of benchmark problems for evaluating algorithms that perform this type of phase retrieval. The data, publicly available online, is provided in an easily interpretable format. We also propose a simple and unambiguous success/failure criterion based on the actual needs in crystallography. Baseline runtimes were obtained with an iterative algorithm that is similar but more transparent than those used in crystallography. Empirically, the runtimes grow exponentially with respect to a new hardness parameter: the sparsity of the signal autocorrelation. We also review the algorithms used by the leading software packages. This set of benchmark problems, we hope, will encourage the development of new algorithms for the phase retrieval problem in general, and crystallography in particular.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑