Image restoration by using a modified proximal point algorithm-Reference-Cited by-同舟云学术

Image restoration by using a modified proximal point algorithm

Published:2023 Issue:4 Volume:8 Page:9557-9575
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Arunchai Areerat¹,Seangwattana Thidaporn²³,Sitthithakerngkiet Kanokwan⁴³,Sombut Kamonrat⁵³

Affiliation:

1. Department of Mathematics and Statistics, Faculty of Science and Technology, Nakhon Sawan Rajabhat University, 60000, Nakhon Sawan, Thailand

2. Faculty of Science Energy and Environment, King Mongkut's University of Technology North Bangkok, Rayong Campus (KMUTNB), 21120, Rayong, Thailand

3. Applied Mathematics for Science and Engineering Research Unit (AMSERU), Department of Mathematics and Computer Science, Faculty of Science and Technology, Rajamangala University of Technology Thanyaburi (RMUTT), 12110, Rungsit-Nakorn Nayok Rd., Klong 6, Khlong Luang, Thanyaburi, Pathum thani, Thailand

4. Intelligent and Nonlinear Dynamic Innovations Research Center, Department of Mathematics Faculty of Applied Science, King Mongkut's University of Technology North Bangkok (KMUTNB), 10800, Bangkok, Thailand

5. Department of Mathematics and Computer Science, Faculty of Science and Technology, Rajamangala University of Technology Thanyaburi (RMUTT), 12110, Pathum Thani, Thailand

Abstract

<abstract>In this paper, we establish a modified proximal point algorithm for solving the common problem between convex constrained minimization and modified variational inclusion problems. The proposed algorithm base on the proximal point algorithm in [<xref ref-type="bibr" rid="b19">19</xref>] and the method of Khuangsatung and Kangtunyakarn in [<xref ref-type="bibr" rid="b21">21</xref>] by using suitable conditions in Hilbert spaces. The proposed algorithm is not only presented in this article; however has also been demonstrated to generate a robust convergence theorem. The proposed algorithm could be used to solve image restoration problems where the images have suffered a variety of blurring operations. Additionally, we contrast the signal-to-noise ratio (SNR) of the proposed algorithm against that of Khuangsatung and Kangtunyakarn's method in [<xref ref-type="bibr" rid="b21">21</xref>] in order to compare image quality.</abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference28 articles.

1. G. P. Crespi, A. Guerraggio, M. Rocca, Minty variational inequality and optimization: Scalar and vector case, In: Generalized convexity and monotonicity and applications, Boston: Springer, 2005. https://doi.org/10.1007/0-387-23639-2_12

2. B. Martinet, Régularisation d'inéquations variationnelles par approximations successives, Recherche Opérationnelle, 4 (1970), 154–158.

3. R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), 877–898. https://doi.org/10.1137/0314056

4. O. Güler, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim., 29 (1991), 403–419. https://doi.org/10.1137/032902

5. S. Kamimura, W. Takahashi, Strong convergence of a proximal-type algorithm in a Banach space, SIAM J. Optim., 13 (2003), 938–945. https://doi.org/10.1137/S105262340139611X

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel inertial forward–backward splitting methods for solving variational inequality problems with variational inclusion constraints;Mathematical Methods in the Applied Sciences;2024-09-08

2. Generalized variational inclusion: graph convergence and dynamical system approach;AIMS Mathematics;2024

3. An Inertial Forward–Backward Splitting Method for Solving Modified Variational Inclusion Problems and Its Application;Mathematics;2023-04-28