CMMSE A Shrinking Projection Algorithm for Split Minimization Problems with Applications to Image Restoration

preprint OA: closed
📄 Open PDF Full text JSON View at publisher
AI-generated deep summary by claude@2026-07, 2026-07-04 · read from full text

This preprint studies a novel shrinking projection algorithm for split minimization problems formulated in infinite-dimensional Hilbert spaces, developing strong convergence results under relaxed conditions and deriving computational methods for practical use. The authors report comprehensive numerical experiments showing improved convergence speed and solution accuracy versus existing algorithms. They apply the approach to signal processing and image restoration tasks such as noise reduction and blur correction. The work is presented as a preprint and explicitly notes it has not been peer reviewed, which is a major limitation for assessing maturity of the results. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

This study introduces a novel shrinking projection algorithm for split minimization problems in infinite-dimensional Hilbert spaces. We establish strong convergence properties under relaxed mathematical conditions and develop related computational methods to extend practical applicability. Comprehensive numerical experiments demonstrate superior performance compared to existing algorithms in terms of convergence speed and solution accuracy. The proposed method successfully addresses signal processing and image restoration challenges, including noise reduction and blur correction.
Full text 6,098 characters · extracted from preprint-html · click to expand
CMMSE A Shrinking Projection Algorithm for Split Minimization Problems with Applications to Image Restoration | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 22 September 2025 V1 Latest version Share on CMMSE A Shrinking Projection Algorithm for Split Minimization Problems with Applications to Image Restoration Authors : Kanokwan Sitthithakerngkiet 0000-0002-8496-7803 , Boonyarit Ngeonkam , and Areerat Arunchai 0000-0001-9569-4057 [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.175852644.41841356/v1 183 views 153 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract This study introduces a novel shrinking projection algorithm for split minimization problems in infinite-dimensional Hilbert spaces. We establish strong convergence properties under relaxed mathematical conditions and develop related computational methods to extend practical applicability. Comprehensive numerical experiments demonstrate superior performance compared to existing algorithms in terms of convergence speed and solution accuracy. The proposed method successfully addresses signal processing and image restoration challenges, including noise reduction and blur correction. Supplementary Material File (cmmse_a_shrinking_projection_algorithm_for_split_minimization_problems_with_applications_to_image_restoration.pdf) Download 9.99 MB Information & Authors Information Version history V1 Version 1 22 September 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords image processing shrinking projection method signal processing split minimization problem Authors Affiliations Kanokwan Sitthithakerngkiet 0000-0002-8496-7803 King Mongkut's University of Technology North Bangkok Faculty of Applied Science View all articles by this author Boonyarit Ngeonkam Nakhon Sawan Rajabhat University View all articles by this author Areerat Arunchai 0000-0001-9569-4057 [email protected] Nakhon Sawan Rajabhat University View all articles by this author Metrics & Citations Metrics Article Usage 183 views 153 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Kanokwan Sitthithakerngkiet, Boonyarit Ngeonkam, Areerat Arunchai. CMMSE A Shrinking Projection Algorithm for Split Minimization Problems with Applications to Image Restoration. Authorea . 22 September 2025. DOI: https://doi.org/10.22541/au.175852644.41841356/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.175852644.41841356/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'a003e9099c0d0704',t:'MTc3OTUzNzczMg=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-02T02:00:03.124865+00:00