紧群上的广义相位检索问题
The generalized phase retrieval problem over compact groups
AI总结:
本文将相位检索推广到紧群上的矩阵恢复,分析其代数结构与唯一性,提出受经典方法启发的算法,并通过数值实验支持稳定性猜想。
摘要:
经典相位检索问题涉及通过利用关于所需信号的先验信息,从其 Fourier 幅值(功率谱)估计信号。本文将该问题扩展到紧群,处理从一组矩阵的 Gram 矩阵恢复这些矩阵的问题。在这一更广泛的背景下,Fourier 空间中缺失的相位被紧群在有限维向量空间上的作用所产生的缺失酉矩阵或正交矩阵所取代。这一推广由多参考对齐和单粒子冷冻电子显微镜(结构生物学中的一项关键技术)中的应用所推动。我们定义了紧群上的广义相位检索问题,并探究其潜在的代数结构。我们综述了关于解唯一性的最新结果,重点关注半代数先验这一重要类别。此外,我们提出了一系列受经典相位检索技术启发的算法。最后,我们基于双 Lipschitz 分析提出了一个关于该问题稳定性的猜想,并得到了数值实验的支持。
英文摘要:
The classical phase retrieval problem involves estimating a signal from its Fourier magnitudes (power spectrum) by leveraging prior information about the desired signal. This paper extends the problem to compact groups, addressing the recovery of a set of matrices from their Gram matrices. In this broader context, the missing phases in Fourier space are replaced by missing unitary or orthogonal matrices arising from the action of a compact group on a finite-dimensional vector space. This generalization is driven by applications in multi-reference alignment and single-particle cryo-electron microscopy, a pivotal technology in structural biology. We define the generalized phase retrieval problem over compact groups and explore its underlying algebraic structure. We survey recent results on the uniqueness of solutions, focusing on the significant class of semialgebraic priors. Furthermore, we present a family of algorithms inspired by classical phase retrieval techniques. Finally, we propose a conjecture on the stability of the problem based on bi-Lipschitz analysis, supported by numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。