arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.07091math.NAcs.NA
收藏

一种用于欧拉弹性模型的新运算分裂方法

A New Operator Splitting Method for Euler's Elastica Model

University of Electronic Science and Technology of China(电子科技大学);University of Houston(休斯顿大学);Hong Kong Baptist University(香港浸会大学)

Liang-Jian Deng, Roland Glowinski, Xue-Cheng Tai

AI总结:

本文提出了一种新的运算分裂算法来最小化欧拉弹性泛函,该方法通过将时间离散化方案应用于与最优系统相关的初始值问题,从而解决了欧拉弹性模型中非凸性、非光滑性和非线性带来的挑战,且算法具有良好的鲁棒性和稳定性。

摘要:

欧拉弹性模型在图像处理和计算机视觉中有广泛的应用。然而,相关的能量泛函的非凸性、非光滑性和非线性使其最小化成为一个具有挑战性的问题,更复杂的是模型中存在高阶导数。在本文中,我们提出了一种新的运算分裂算法来最小化欧拉弹性泛函。该算法是通过将基于运算分裂的时间离散化方案应用于与最优系统(一组多值方程)相关的初始值问题(动力学流)而获得的。分裂方案的三个分数步骤相关的子问题要么有闭合形式解,要么可以由快速专用求解器处理。与依赖于ADMM(交替方向乘子法)的早期方法相比,新方法本质上只有时间离散化步骤作为自由参数来选择,从而得到一个非常稳健和稳定的算法。子问题的简单性和模块化使得该算法非常高效。对平滑测试问题的数值求解应用展示了所提出方法的效率和鲁棒性。

英文摘要:

Euler's elastica model has a wide range of applications in Image Processing and Computer Vision. However, the non-convexity, the non-smoothness and the nonlinearity of the associated energy functional make its minimization a challenging task, further complicated by the presence of high order derivatives in the model. In this article we propose a new operator-splitting algorithm to minimize the Euler elastica functional. This algorithm is obtained by applying an operator-splitting based time discretization scheme to an initial value problem (dynamical flow) associated with the optimality system (a system of multivalued equations). The sub-problems associated with the three fractional steps of the splitting scheme have either closed form solutions or can be handled by fast dedicated solvers. Compared with earlier approaches relying on ADMM (Alternating Direction Method of Multipliers), the new method has, essentially, only the time discretization step as free parameter to choose, resulting in a very robust and stable algorithm. The simplicity of the sub-problems and its modularity make this algorithm quite efficient. Applications to the numerical solution of smoothing test problems demonstrate the efficiency and robustness of the proposed methodology.

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

↑