从局部稳定连续测量恢复稳定相位
Stable Phase Retrieval from Locally Stable and Conditionally Connected Measurements
摘要:
本文研究了一类相位恢复模型的稳定相位恢复,我们称之为“局部稳定和条件连接”(LSCC)测量方案。对于每一个信号$f$,我们关联一个相应的加权图$G_f$,定义的LSCC测量方案,并表明,相位恢复的信号$f$是由$G_f$的连接性。然后,我们表征的相位恢复稳定性的信号$f$的两个措施,通常用于在图论中量化图形连接:Cheeger常数的$G_f$为实值信号,和代数连接的$G_f$为复值信号。我们使用我们的研究结果来研究两个阶段的恢复模型,可以铸造LSCC测量方案的稳定性,并专注于了解哪些信号的“维数灾难”可以避免。我们讨论的第一个模型是一个有限维模型,局部支持的测量,如窗口傅立叶变换。对于信号“没有大的孔”,我们显示的稳定常数只表现出温和的多项式增长的尺寸,在指数增长的均匀稳定常数往往遭受形成鲜明对比,更准确地说,在$R^d$常数增长成比例的$d^{1/2}$,而在$C^d$它成比例地增长到$d$。我们还表明,在复杂的情况下,常数的增长不能减少,这表明,复杂的相位检索比真正的相位检索困难得多。我们考虑的第二个模型是一个无限维的相位恢复问题的主要移位不变空间。我们发现,尽管这个模型的无穷维,单调指数衰减的信号将有一个有限的稳定常数。相反,如果信号的衰减是多项式的,我们的结果提供的稳定性界限将是无限的。
英文摘要:
This paper is concerned with stable phase retrieval for a family of phase retrieval models we name "locally stable and conditionally connected" (LSCC) measurement schemes. For every signal $f$, we associate a corresponding weighted graph $G_f$, defined by the LSCC measurement scheme, and show that the phase retrievability of the signal $f$ is determined by the connectivity of $G_f$. We then characterize the phase retrieval stability of the signal $f$ by two measures that are commonly used in graph theory to quantify graph connectivity: the Cheeger constant of $G_f$ for real valued signals, and the algebraic connectivity of $G_f$ for complex valued signals. We use our results to study the stability of two phase retrieval models that can be cast as LSCC measurement schemes, and focus on understanding for which signals the "curse of dimensionality" can be avoided. The first model we discuss is a finite-dimensional model for locally supported measurements such as the windowed Fourier transform. For signals "without large holes", we show the stability constant exhibits only a mild polynomial growth in the dimension, in stark contrast with the exponential growth which uniform stability constants tend to suffer from; more precisely, in $R^d$ the constant grows proportionally to $d^{1/2}$, while in $C^d$ it grows proportionally to $d$. We also show the growth of the constant in the complex case cannot be reduced, suggesting that complex phase retrieval is substantially more difficult than real phase retrieval. The second model we consider is an infinite-dimensional phase retrieval problem in a principal shift invariant space. We show that despite the infinite dimensionality of this model, signals with monotone exponential decay will have a finite stability constant. In contrast, the stability bound provided by our results will be infinite if the signal's decay is polynomial.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。