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

短时傅里叶变换超分辨理论

A Theory of Super-Resolution from Short-Time Fourier Transform Measurements

Céline Aubel, David Stotz, Helmut Bölcskei

摘要:

虽然尖峰序列显然不是带限的,但超分辨率理论告诉我们,如果尖峰之间的最小间距$Δ$不太小,则可以从低通傅立叶变换测量中完美恢复未知尖峰位置和权重。具体而言,对于$f_c$的测量截止频率,Donoho [2]表明,如果尖峰(在$\mathbb{R}$上)位于晶格和$Δ> 1/f_c$上,则精确恢复是可能的,但没有指定相应的恢复方法。Cand $\text{è}$ s和Fernando-Granda [3,4]提供了一种用于恢复周期性尖峰序列的凸规划方法(即,在环面$\mathbb{T}$上的尖峰序列),如果$Δ> 2/f_c$和$f_c \geq 128$或者如果$Δ> 1.26/f_c$和$f_c \geq 10^3$,则其可证明成功,并且不需要基本周期内的尖峰位于晶格上。在本文中,我们开发了一个理论的超分辨率从短时傅里叶变换(STFT)的测量。具体地说,我们提出了一个恢复方法类似的精神[3]中的纯傅立叶测量。对于宽度为$σ= 1/(4f_c)$的STFT高斯窗函数,如果$Δ> 1/f_c$,则该方法可证明成功,而对$f_c$没有限制。我们的理论是基于测量理论制定的恢复问题,这导致相当大的普遍性的意义上的结果是网格免费和适用于尖峰列车上的$\mathbb{R}$和$\mathbb{T}$。$\mathbb{R}$上的尖峰列车的情况伴随着重大的技术挑战。对于恢复尖峰列车$\mathbb{T}$,我们证明了正确的解决方案可以近似--在弱 * 拓扑-通过解决一系列有限维凸规划问题。

英文摘要:

While spike trains are obviously not band-limited, the theory of super-resolution tells us that perfect recovery of unknown spike locations and weights from low-pass Fourier transform measurements is possible provided that the minimum spacing, $Δ$, between spikes is not too small. Specifically, for a measurement cutoff frequency of $f_c$, Donoho [2] showed that exact recovery is possible if the spikes (on $\mathbb{R}$) lie on a lattice and $Δ> 1/f_c$, but does not specify a corresponding recovery method. Cand$\text{è}$s and Fernandez-Granda [3, 4] provide a convex programming method for the recovery of periodic spike trains (i.e., spike trains on the torus $\mathbb{T}$), which succeeds provably if $Δ> 2/f_c$ and $f_c \geq 128$ or if $Δ> 1.26/f_c$ and $f_c \geq 10^3$, and does not need the spikes within the fundamental period to lie on a lattice. In this paper, we develop a theory of super-resolution from short-time Fourier transform (STFT) measurements. Specifically, we present a recovery method similar in spirit to the one in [3] for pure Fourier measurements. For a STFT Gaussian window function of width $σ= 1/(4f_c)$ this method succeeds provably if $Δ> 1/f_c$, without restrictions on $f_c$. Our theory is based on a measure-theoretic formulation of the recovery problem, which leads to considerable generality in the sense of the results being grid-free and applying to spike trains on both $\mathbb{R}$ and $\mathbb{T}$. The case of spike trains on $\mathbb{R}$ comes with significant technical challenges. For recovery of spike trains on $\mathbb{T}$ we prove that the correct solution can be approximated---in weak-* topology---by solving a sequence of finite-dimensional convex programming problems.

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

↑