Fixed Point Techniques for Graph-Based Mappings with Image Recovery Approach
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i3.6311Keywords:
fixed point problem, directed graph, G-nonexpansive mapping, image processing , process innovationAbstract
This article introduces an algorithm designed to approximate a common fixed point for a class of graph-based mappings in a real Hilbert space. We show that the sequence generated by this algorithm weakly converges to a common fixed point. Moreover, we explore the algorithm's practical application by investigating its effectiveness in solving image recovery problems related to PM2.5. Its performance is then evaluated by comparing it to existing methods.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Sayan Panma, Raweerote Suparatulatorn, Tanadon Chaobankoh
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.