An inexact proximal majorization–minimization method for a class of image reconstruction models

Abstract We propose a class of nonconvex and nonsmooth image reconstruction models for impulse noise removal, which is rather general and covers existing nonconvex and nonsmooth models for reconstructing images with impulse noise. For this class of models, we develop an inexact proximal majorization–minimization algorithm with an implementable inexactness criterion by constructing a strongly convex local majorization of the objective function and meanwhile seeking its inexact minimizer in each iteration, and provide its theoretical certificate by proving the full convergence of the iterate sequence under the Kurdyka–Łojasiewicz property of the constructed potential function. This inexact proximal majorization–minimization method is applied to linear image restoration problems from deblurring and inpainting, and a class of nonlinear image reconstruction from Fourier phase retrieval (PR). Numerical comparisons with the proximal linearized minimization algorithm for image deblurring and the alternating direction method of multipliers for image inpainting and Fourier PR validate the efficiency of the proposed method.

Authors

Publication Details

Journal
Inverse Problems
Published
2025-05-09
DOI
https://doi.org/10.1088/1361-6420/add6d1
Citations
1
Primary Topic
Medical Imaging Techniques and Applications
Type
article
Field-Weighted Citation Impact
1.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An inexact proximal majorization–minimization method for a class of image reconstruction models

Tieyong Zeng, Bujin Li, PAN SHAO-HUA
1 citations
Inverse Problems
Medical Imaging Techniques and Applications
1.36
article

An inexact proximal majorization–minimization method for a class of image reconstruction models

Tieyong Zeng, Bujin Li, PAN SHAO-HUA
article en
1 citations

Abstract

Abstract We propose a class of nonconvex and nonsmooth image reconstruction models for impulse noise removal, which is rather general and covers existing nonconvex and nonsmooth models for reconstructing images with impulse noise. For this class of models, we develop an inexact proximal majorization–minimization algorithm with an implementable inexactness criterion by constructing a strongly convex local majorization of the objective function and meanwhile seeking its inexact minimizer in each iteration, and provide its theoretical certificate by proving the full convergence of the iterate sequence under the Kurdyka–Łojasiewicz property of the constructed potential function. This inexact proximal majorization–minimization method is applied to linear image restoration problems from deblurring and inpainting, and a class of nonlinear image reconstruction from Fourier phase retrieval (PR). Numerical comparisons with the proximal linearized minimization algorithm for image deblurring and the alternating direction method of multipliers for image inpainting and Fourier PR validate the efficiency of the proposed method.

Inverse ProblemsVol. 41(6)
National Natural Science Foundation of China
Openalex Percentile: Top 20%
Medical Imaging Techniques and Applications
1.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.