Adv. Appl. Math. Mech., 17 (2025), pp. 148-174.
Published online: 2024-12
Cited by
- BibTex
- RIS
- TXT
In this paper, we propose a nonconvex and nonsmooth model for image restoration with Cauchy noise removal. The regularization term is composed of a nonconvex Lipschitz potential function with first-order derivatives of an image, while the data fidelity term is introduced based on the maximum a posteriori estimator to Cauchy distribution. To handle the nonconvexity of regularizers, we adopt the proximal linearization technique to convert the original nonconvex model to a series of convex models, which can be easily implemented by alternating direction method with multipliers. Based on the Kurdyka-Łojasiewicz property, we can verify the global convergence of the proposed algorithm by using an abstract convergence framework. Numerical experiments and comparisons indicate that our method obtains good restorations and is effective for better preserving edges.
}, issn = {2075-1354}, doi = {https://doi.org/10.4208/aamm.OA-2022-0243}, url = {http://global-sci.org/intro/article_detail/aamm/23596.html} }In this paper, we propose a nonconvex and nonsmooth model for image restoration with Cauchy noise removal. The regularization term is composed of a nonconvex Lipschitz potential function with first-order derivatives of an image, while the data fidelity term is introduced based on the maximum a posteriori estimator to Cauchy distribution. To handle the nonconvexity of regularizers, we adopt the proximal linearization technique to convert the original nonconvex model to a series of convex models, which can be easily implemented by alternating direction method with multipliers. Based on the Kurdyka-Łojasiewicz property, we can verify the global convergence of the proposed algorithm by using an abstract convergence framework. Numerical experiments and comparisons indicate that our method obtains good restorations and is effective for better preserving edges.