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

基于截断振幅流的稀疏相位恢复

Sparse Phase Retrieval via Truncated Amplitude Flow

Gang Wang, Liang Zhang, Georgios B. Giannakis, Mehmet Akcakaya, Jie Chen

摘要:

本文提出了一种新的算法,称为\emph{SPARse Truncated Amplitude flow}(SPARTA),从少量的幅度测量重建稀疏信号。它涉及也被称为稀疏相位恢复(PR)的东西,其通常是\emph{NP-hard},并且出现在许多科学和工程应用中。SPARTA将稀疏PR问题描述为一个基于幅度的非凸优化问题,分两个阶段迭代求解:第一阶段,利用解析证明的规则恢复稀疏信号的支持度,然后通过限制支持度的幂次迭代获得稀疏正交性提升的初始值;并且在第二阶段中,通过基于硬阈值的梯度型迭代来连续地细化初始化。SPARTA是一个简单而有效的,可扩展的,快速的稀疏PR求解器。在理论方面,对于任何$n$维$k$稀疏($k\ll n$)信号$\bm{x}$,其最小(模数)非零项的数量级为$(1/\sqrt{k})\|\bm{x}\|_2$,SPARTA以高概率从大约$k^2\log n$随机高斯测量中精确地恢复信号(直到全局单模常数).此外,SPARTA导致$k^2n\log n$数量级的计算复杂性,总运行时间与读取数据所需的时间成比例,这在现有技术基础上至少提高了$k$的一个因子。最后,SPARTA对有界支撑的加性噪声具有鲁棒性。广泛的数值试验证实显着改善恢复性能和加速SPARTA相对于现有的替代品。

英文摘要:

This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements. It deals with what is also known as sparse phase retrieval (PR), which is \emph{NP-hard} in general and emerges in many science and engineering applications. Upon formulating sparse PR as an amplitude-based nonconvex optimization task, SPARTA works iteratively in two stages: In stage one, the support of the underlying sparse signal is recovered using an analytically well-justified rule, and subsequently, a sparse orthogonality-promoting initialization is obtained via power iterations restricted on the support; and, in the second stage, the initialization is successively refined by means of hard thresholding based gradient-type iterations. SPARTA is a simple yet effective, scalable, and fast sparse PR solver. On the theoretical side, for any $n$-dimensional $k$-sparse ($k\ll n$) signal $\bm{x}$ with minimum (in modulus) nonzero entries on the order of $(1/\sqrt{k})\|\bm{x}\|_2$, SPARTA recovers the signal exactly (up to a global unimodular constant) from about $k^2\log n$ random Gaussian measurements with high probability. Furthermore, SPARTA incurs computational complexity on the order of $k^2n\log n$ with total runtime proportional to the time required to read the data, which improves upon the state-of-the-art by at least a factor of $k$. Finally, SPARTA is robust against additive noise of bounded support. Extensive numerical tests corroborate markedly improved recovery performance and speedups of SPARTA relative to existing alternatives.

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

↑