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

极低计数状态下的Poisson相位恢复

Poisson Phase Retrieval in Very Low-count Regimes

Zongyu Li, Kenneth Lange, Jeffrey A. Fessler

摘要:

本文讨论了相位恢复算法的最大似然(ML)估计从测量以下独立泊松分布在非常低的计数制度,例如,0.25每像素光子数为了最大化泊松ML模型的对数似然,我们提出了一种改进的Wirtinger流(WF)算法,该算法使用基于观察到的Fisher信息的步长。这种方法消除了除迭代次数之外的所有参数调整。我们还提出了一种新的曲率优化最小化(MM)算法与二次优化。我们从理论上表明,我们提出的曲率比来自泊松ML成本函数的二阶导数的上确界的曲率更尖锐。我们比较了所提出的算法(WF,MM)与现有的优化方法,包括WF使用其他步长计划,拟牛顿法,如LBFGS和交替方向乘法器(ADMM)算法,在各种实验设置。随机高斯矩阵,规范DFT矩阵,掩蔽DFT矩阵和经验传输矩阵的仿真实验证明了以下几点。1)正如预期的那样,当应用于低计数数据时,基于泊松ML模型的算法始终比来自高斯噪声ML模型的算法产生更高质量的重建。2)对于未正则化的情况,我们提出的WF算法与Fisher信息的步长收敛速度比其他WF方法,例如,WF具有经验步长,回溯线搜索和高斯噪声模型的最佳步长;它也比LBFGS拟牛顿方法收敛得更快。3)在正则化的情况下,我们提出的WF算法收敛速度比WF回溯线搜索,LBFGS,MM和ADMM。

英文摘要:

This paper discusses phase retrieval algorithms for maximum likelihood (ML) estimation from measurements following independent Poisson distributions in very low-count regimes, e.g., 0.25 photon per pixel. To maximize the log-likelihood of the Poisson ML model, we propose a modified Wirtinger flow (WF) algorithm using a step size based on the observed Fisher information. This approach eliminates all parameter tuning except the number of iterations. We also propose a novel curvature for majorize-minimize (MM) algorithms with a quadratic majorizer. We show theoretically that our proposed curvature is sharper than the curvature derived from the supremum of the second derivative of the Poisson ML cost function. We compare the proposed algorithms (WF, MM) with existing optimization methods, including WF using other step-size schemes, quasi-Newton methods such as LBFGS and alternating direction method of multipliers (ADMM) algorithms, under a variety of experimental settings. Simulation experiments with a random Gaussian matrix, a canonical DFT matrix, a masked DFT matrix and an empirical transmission matrix demonstrate the following. 1) As expected, algorithms based on the Poisson ML model consistently produce higher quality reconstructions than algorithms derived from Gaussian noise ML models when applied to low-count data. 2) For unregularized cases, our proposed WF algorithm with Fisher information for step size converges faster than other WF methods, e.g., WF with empirical step size, backtracking line search, and optimal step size for the Gaussian noise model; it also converges faster than the LBFGS quasi-Newton method. 3) In regularized cases, our proposed WF algorithm converges faster than WF with backtracking line search, LBFGS, MM and ADMM.

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

↑