arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.02328math.OCcs.DC
收藏

分块分布优化-最小记忆梯度算法及其在三维图像复原中的应用

Block Distributed Majorize-Minimize Memory Gradient Algorithm and its application to 3D image restoration

Mathieu Chalvidal, Emilie Chouzenoux

摘要:

现代3D图像恢复问题需要强大的优化框架来处理高维问题,同时在合理的时间内提供可靠的数值解。在这个角度来看,异步并行优化算法已经收到了越来越多的关注,克服内存限制问题和通信瓶颈。针对大规模非凸可微最优化问题,提出了一种块分布式优化算法BD 3 MG。假设一个分布式存储器环境中,该算法铸造成更小的维度子问题的变量块以异步方式解决的高效3 MG计划。在温和的假设下,建立了建议的BD 3 MG方法的序列的收敛性。应用程序的深度变化模糊退化的3D图像的恢复表明,我们的方法产生显着的计算时间减少相比,几个同步和异步的竞争对手,同时表现出很大的可扩展性潜力。

英文摘要:

Modern 3D image recovery problems require powerful optimization frameworks to handle high dimensionality while providing reliable numerical solutions in a reasonable time. In this perspective, asynchronous parallel optimization algorithms have received an increasing attention by overcoming memory limitation issues and communication bottlenecks. In this work, we propose a block distributed Majorize-Minorize Memory Gradient (BD3MG) optimization algorithm for solving large scale non-convex differentiable optimization problems. Assuming a distributed memory environment, the algorithm casts the efficient 3MG scheme into smaller dimension subproblems where blocks of variables are addressed in an asynchronous manner. Convergence of the sequence built by the proposed BD3MG method is established under mild assumptions. Application to the restoration of 3D images degraded by a depth-variant blur shows that our method yields significant computational time reduction compared to several synchronous and asynchronous competitors, while exhibiting great scalability potential.

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

↑