通过稀疏性实现超分辨率的恢复极限
The recoverability limit for superresolution via sparsity
AI总结:
研究通过稀疏系数向量恢复问题,探讨超分辨率因子SRF对恢复精度的影响,提出在加性确定性噪声下,最小最大误差率与SRF和噪声水平的关系。
摘要:
我们考虑从生成的傅里叶级数在区间[-Ω, Ω]上恢复k-稀疏系数向量的问题。该问题的难度与超分辨率因子SRF相关,等于Rayleigh长度(Ω的倒数)与稀疏向量支持网格间距的比值。在存在加性确定性噪声的情况下,我们展示了最小最大误差率的上界和下界,两者均按(SRF)^(2k-1)σ缩放,部分回答了Donoho于1992年提出的问题。该缩放源于将噪声水平与稀疏性2k的限制等距常数进行比较,或等价地将2k与所谓的σ-spark进行比较。证明涉及新的受限傅里叶矩阵奇异值界,部分基于复分析中的旧技术。
英文摘要:
We consider the problem of robustly recovering a $k$-sparse coefficient vector from the Fourier series that it generates, restricted to the interval $[- Ω, Ω]$. The difficulty of this problem is linked to the superresolution factor SRF, equal to the ratio of the Rayleigh length (inverse of $Ω$) by the spacing of the grid supporting the sparse vector. In the presence of additive deterministic noise of norm $σ$, we show upper and lower bounds on the minimax error rate that both scale like $(SRF)^{2k-1} σ$, providing a partial answer to a question posed by Donoho in 1992. The scaling arises from comparing the noise level to a restricted isometry constant at sparsity $2k$, or equivalently from comparing $2k$ to the so-called $σ$-spark of the Fourier system. The proof involves new bounds on the singular values of restricted Fourier matrices, obtained in part from old techniques in complex analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。