arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.01878math.OC
收藏

稀疏相位约束下的相位恢复

Phase retrieval with sparse phase constraint

Hieu Thao Nguyen, D. Russell Luke, Oleg Soloviev, Michel Verhaegen

摘要:

本文首次研究了相位恢复问题,假设相位(复信号)是稀疏的,与稀疏信号处理文献中考虑的信号本身的稀疏性假设相反。这个新的问题模型,这将在后续文件中进行的预期应用,是实际的相位恢复问题的像差相位是稀疏的泽尼克多项式的正交基。这种问题在本文中被称为稀疏相位恢复(SPR)问题。当出瞳处的振幅调制是均匀的时,提出了一种新的相位稀疏正则化方法来捕捉SPR问题的稀疏性。基于这种正则化方案,我们设计并分析了一种有效解方法,称为SROP算法,用于求解仅给定单个强度点扩散函数图像的SPR。该算法是Gerchberg-Saxton算法与新提出的相位稀疏正则化的结合。后一个正则化步骤在数学上是旋转,但方向在迭代中变化。令人惊讶的是,这种旋转被证明是一个度量投影的辅助集是独立的迭代。因此,SROP算法被证明是一个循环投影算法,用于解决涉及三个辅助集的可行性问题。通过对后一种辅助集的正则性分析,基于循环投影算法的最新收敛性理论,得到了SROP算法的收敛性结果。数值结果表明,新的正则化格式解决SPR问题的有效性。

英文摘要:

For the first time, this paper investigates the phase retrieval problem with the assumption that the phase (of the complex signal) is sparse in contrast to the sparsity assumption on the signal itself as considered in the literature of sparse signal processing. The intended application of this new problem model, which will be conducted in a follow-up paper, is to practical phase retrieval problems where the aberration phase is sparse with respect to the orthogonal basis of Zernike polynomials. Such a problem is called sparse phase retrieval (SPR) problem in this paper. When the amplitude modulation at the exit pupil is uniform, a new scheme of sparsity regularization on phase is proposed to capture the sparsity property of the SPR problem. Based on this regularization scheme, we design and analyze an efficient solution method, named SROP algorithm, for solving SPR given only a single intensity point-spread-function image. The algorithm is a combination of the Gerchberg-Saxton algorithm with the newly proposed sparsity regularization on the phase. The latter regularization step is mathematically a rotation but with direction varying in iterations. Surprisingly, this rotation is shown to be a metric projection on an auxiliary set which is independent of iterations. As a consequence, SROP algorithm is proved to be the cyclic projections algorithm for solving a feasibility problem involving three auxiliary sets. Analyzing regularity properties of the latter auxiliary sets, we obtain convergence results for SROP algorithm based on recent convergence theory for the cyclic projections algorithm. Numerical results show clear effectiveness of the new regularization scheme for solving the SPR problem.

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

↑