A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model

Euler's elastica model has been widely used in image processing. Since it is a challenging nonconvex and nonsmooth optimization model, most existing algorithms do not have convergence theory for it. In this paper, we propose a penalty relaxation algorithm with mathematical guarantee to find a stationary point of Euler's elastica model. To deal with the nonsmoothness of Euler's elastica model, we first introduce a smoothing relaxation problem, and then propose an exact penalty method to solve it. We establish the relationships between Euler's elastica model, the smoothing relaxation problem, and the penalty problem in theory regarding optimal solutions and stationary points. Moreover, we propose an efficient block coordinate descent algorithm to solve the penalty problem by taking advantage of convexity of its subproblems. We prove global convergence of the algorithm to a stationary point of the penalty problem. Finally we apply the proposed algorithm to denoise the optical coherence tomography images with real data from an optometry clinic and show the efficiency of the method for image processing using Euler's elastica model.

Automated summary

This study proposed a penalty relaxation algorithm with mathematical guarantee to find a stationary point of Euler's elastica model, dealing with its nonsmoothness. Additionally, theoretical relationships were established and an efficient block coordinate descent algorithm was introduced for solving the problem.