Hojjatollah Shokri Kaveh , Masoud Hajarian , Anthony T. Chronopoulos
{"title":"Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations","authors":"Hojjatollah Shokri Kaveh , Masoud Hajarian , Anthony T. Chronopoulos","doi":"10.1016/j.jfranklin.2025.107634","DOIUrl":null,"url":null,"abstract":"<div><div>In image and signal processing, one or more transformations are applied to the desired image (signal), and the original image (signal) should be reconstructed by reversing these transformations. One important equation for modeling image (signal) processing problems is the Sylvester matrix equation, which modifies the image by applying two transformations on both sides. In this paper, we introduce an algorithm for solving the Sylvester matrix equation based on the conjugate gradient algorithm. This algorithm employs the <span><math><mi>s</mi></math></span>-step technique to reduce communication overhead and aims to enhance its performance by adjusting the <span><math><mi>s</mi></math></span> parameter during the iterations. Since the algorithm can become unstable with a sudden increase in <span><math><mi>s</mi></math></span>, this instability is addressed through the use of mapped regularization filters. Finally, the effectiveness and efficiency of the algorithm are evaluated using several numerical examples.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 6","pages":"Article 107634"},"PeriodicalIF":3.7000,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Franklin Institute-engineering and Applied Mathematics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0016003225001280","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In image and signal processing, one or more transformations are applied to the desired image (signal), and the original image (signal) should be reconstructed by reversing these transformations. One important equation for modeling image (signal) processing problems is the Sylvester matrix equation, which modifies the image by applying two transformations on both sides. In this paper, we introduce an algorithm for solving the Sylvester matrix equation based on the conjugate gradient algorithm. This algorithm employs the -step technique to reduce communication overhead and aims to enhance its performance by adjusting the parameter during the iterations. Since the algorithm can become unstable with a sudden increase in , this instability is addressed through the use of mapped regularization filters. Finally, the effectiveness and efficiency of the algorithm are evaluated using several numerical examples.
期刊介绍:
The Journal of The Franklin Institute has an established reputation for publishing high-quality papers in the field of engineering and applied mathematics. Its current focus is on control systems, complex networks and dynamic systems, signal processing and communications and their applications. All submitted papers are peer-reviewed. The Journal will publish original research papers and research review papers of substance. Papers and special focus issues are judged upon possible lasting value, which has been and continues to be the strength of the Journal of The Franklin Institute.