arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.10461cs.ITeess.SPmath.ITmath.OC
收藏

正源的压缩超分辨

Compressed Super-Resolution of Positive Sources

Maxime Ferreira Da Costa, Yuejie Chi

摘要:

原子范数最小化是一种凸优化框架,用于从点源的低通观测值的子集中恢复点源,或者等效地从频谱稀疏信号的潜在频率中恢复点源。当源的振幅为正时,可以用公式表示正的原子范数,并且只要观测的数量大于源的数量,就可以确保精确的恢复,而无需在源之间施加分离。然而,原子范数的经典公式需要解决一个半定的程序,涉及一个线性矩阵不等式的大小的顺序的信号维,这可能是禁止的。在这封信中,我们介绍了一种新的“压缩”半定规划,它涉及到一个线性矩阵不等式的数量级的源的减少的维。我们保证了在一定条件下,这个程序的紧密性的运营商参与降维。最后,我们将所提出的方法应用于基于二阶统计量的稀疏阵列测向,并实现了显着的计算节省。

英文摘要:

Atomic norm minimization is a convex optimization framework to recover point sources from a subset of their low-pass observations, or equivalently the underlying frequencies of a spectrally-sparse signal. When the amplitudes of the sources are positive, a positive atomic norm can be formulated, and exact recovery can be ensured without imposing a separation between the sources, as long as the number of observations is greater than the number of sources. However, the classic formulation of the atomic norm requires to solve a semidefinite program involving a linear matrix inequality of a size on the order of the signal dimension, which can be prohibitive. In this letter, we introduce a novel "compressed" semidefinite program, which involves a linear matrix inequality of a reduced dimension on the order of the number of sources. We guarantee the tightness of this program under certain conditions on the operator involved in the dimensionality reduction. Finally, we apply the proposed method to direction finding over sparse arrays based on second-order statistics and achieve significant computational savings.

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

↑