arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.10081cs.ITmath.AGmath.IT
收藏

晶体学相恢复问题的数学理论

Toward a mathematical theory of the crystallographic phase retrieval problem

Tamir Bendory, Dan Edidin

摘要:

受X射线晶体学技术确定生物分子原子结构的启发,我们研究了晶体学相位恢复问题,可以说是领先的和最困难的相位恢复设置。这个问题需要从其傅立叶幅度或等效地从其周期性自相关中恢复长度为N的K稀疏信号。具体来说,这项工作的重点是唯一性的基本问题:什么是最大的稀疏水平K/N,允许信号和它的傅立叶幅度之间的唯一映射,直到内在的对称性。我们设计了一个系统的计算技术来确认任何特定对(K,N)的唯一性,并建立以下猜想:傅立叶幅度确定一个通用的信号唯一,直到内在对称性,只要K<=N/2。基于群论的考虑和额外的计算技术,我们提出了第二个猜想:如果K<N/2,那么对于任何信号,晶体学相位恢复问题的解集在具有给定傅立叶幅度的所有信号的集合中测量为零。总之,这些成果构成了第一次尝试建立一个数学理论的结晶相恢复问题。

英文摘要:

Motivated by the X-ray crystallography technology to determine the atomic structure of biological molecules, we study the crystallographic phase retrieval problem, arguably the leading and hardest phase retrieval setup. This problem entails recovering a K-sparse signal of length N from its Fourier magnitude or, equivalently, from its periodic auto-correlation. Specifically, this work focuses on the fundamental question of uniqueness: what is the maximal sparsity level K/N that allows unique mapping between a signal and its Fourier magnitude, up to intrinsic symmetries. We design a systemic computational technique to affirm uniqueness for any specific pair (K,N), and establish the following conjecture: the Fourier magnitude determines a generic signal uniquely, up to intrinsic symmetries, as long as K<=N/2. Based on group-theoretic considerations and an additional computational technique, we formulate a second conjecture: if K<N/2, then for any signal the set of solutions to the crystallographic phase retrieval problem has measure zero in the set of all signals with a given Fourier magnitude. Together, these conjectures constitute the first attempt to establish a mathematical theory for the crystallographic phase retrieval problem.

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

↑