arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.1209physics.optics
收藏

用凸松弛法求解重叠关联

Solving ptychography with a convex relaxation

Roarke Horstmeyer, Richard Y. Chen, Xiaoze Ou, Brendan Ames, Joel A. Tropp, Changhuei Yang

摘要:

重叠关联是一种强大的计算成像技术,它将低分辨率图像的集合转换为高分辨率的样本重建。不幸的是,目前用于解决这个重建问题的算法缺乏稳定性,鲁棒性和理论保证。最近,凸优化算法提高了几个相关的重建工作的准确性和可靠性。本文提出了重叠关联问题的一个凸形式。该公式没有局部最小值,它可以使用各种算法来求解,它可以包含适当的噪声模型,并且它可以包括多个先验约束。本文考虑了一个特定的算法,基于低秩因式分解,其运行时间和内存使用的输出图像的大小是近线性的。实验表明,这种方法提供了一个平均比交替投影,目前的标准算法重叠关联重建低25%的背景方差。

英文摘要:

Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that are currently used to solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no local minima, it can be solved using a wide range of algorithms, it can incorporate appropriate noise models, and it can include multiple a priori constraints. The paper considers a specific algorithm, based on low-rank factorization, whose runtime and memory usage are near-linear in the size of the output image. Experiments demonstrate that this approach offers a 25% lower background variance on average than alternating projections, the current standard algorithm for ptychographic reconstruction.

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

↑