An inexact proximal MM method for a class of nonconvex composite image reconstruction models
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913283696492544 |
|---|---|
| author | Li, Bujin Pan, Shaohua Zeng, Tieyong |
| author_facet | Li, Bujin Pan, Shaohua Zeng, Tieyong |
| contents | This paper concerns a class of composite image reconstruction models for impluse noise removal, which is rather general and covers existing convex and nonconvex models proposed for reconstructing images with impluse noise. For this nonconvex and nonsmooth optimization problem, we propose a proximal majorization-minimization (MM) algorithm with an implementable inexactness criterion by seeking in each step an inexact minimizer of a strongly convex majorization of the objective function, and establish the convergence of the iterate sequence under the KL assumption on the constructed potential function. This inexact proximal MM method is applied to handle gray image deblurring and color image inpainting problems, for which the associated potential function satisfy the required KL assumption. Numerical comparisons with two state-of-art solvers for image deblurring and inpainting tasks validate the efficiency of the proposed algorithm and models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_17450 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An inexact proximal MM method for a class of nonconvex composite image reconstruction models Li, Bujin Pan, Shaohua Zeng, Tieyong Optimization and Control 94A08, 90C26, 65K10, 49J42 This paper concerns a class of composite image reconstruction models for impluse noise removal, which is rather general and covers existing convex and nonconvex models proposed for reconstructing images with impluse noise. For this nonconvex and nonsmooth optimization problem, we propose a proximal majorization-minimization (MM) algorithm with an implementable inexactness criterion by seeking in each step an inexact minimizer of a strongly convex majorization of the objective function, and establish the convergence of the iterate sequence under the KL assumption on the constructed potential function. This inexact proximal MM method is applied to handle gray image deblurring and color image inpainting problems, for which the associated potential function satisfy the required KL assumption. Numerical comparisons with two state-of-art solvers for image deblurring and inpainting tasks validate the efficiency of the proposed algorithm and models. |
| title | An inexact proximal MM method for a class of nonconvex composite image reconstruction models |
| topic | Optimization and Control 94A08, 90C26, 65K10, 49J42 |
| url | https://arxiv.org/abs/2403.17450 |