“求解凸可行性问题的几种平行仿射投影算法在划痕修复中的应用的可视化和数值比较研究”

IF 1.4 4区数学 Q1 MATHEMATICS

Carpathian Journal of Mathematics Pub Date : 2022-02-28 DOI:10.37193/cjm.2022.02.03

Irina Maria Artinescu, C. Boldea

{"title":"“求解凸可行性问题的几种平行仿射投影算法在划痕修复中的应用的可视化和数值比较研究”","authors":"Irina Maria Artinescu, C. Boldea","doi":"10.37193/cjm.2022.02.03","DOIUrl":null,"url":null,"abstract":"\"The paper compares four variants of algorithms that solve the problem of Convex Feasibility using affine combinations of projections, two classical variants of Parallel Projection Method (PPM) and two modified variants that involve variable weight, in terms of their effectiveness in inpainting a convex polygon, as well as in terms of their convergence in a finite a number of step. We also present a numerical study of the dependence of the efficiency and the execution speed of these algorithms on the shape of the inpainted convex set, as well as on the values of the relaxation parameter.\"","PeriodicalId":50711,"journal":{"name":"Carpathian Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"\\\"A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting\\\"\",\"authors\":\"Irina Maria Artinescu, C. Boldea\",\"doi\":\"10.37193/cjm.2022.02.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\\"The paper compares four variants of algorithms that solve the problem of Convex Feasibility using affine combinations of projections, two classical variants of Parallel Projection Method (PPM) and two modified variants that involve variable weight, in terms of their effectiveness in inpainting a convex polygon, as well as in terms of their convergence in a finite a number of step. We also present a numerical study of the dependence of the efficiency and the execution speed of these algorithms on the shape of the inpainted convex set, as well as on the values of the relaxation parameter.\\\"\",\"PeriodicalId\":50711,\"journal\":{\"name\":\"Carpathian Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Carpathian Journal of Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.37193/cjm.2022.02.03\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Carpathian Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37193/cjm.2022.02.03","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

“本文比较了使用投影的仿射组合来解决凸可行性问题的四种算法变体，这是并行投影方法（PPM）的两种经典变体以及两个涉及可变权重的修改变体，就其在修复凸多边形方面的有效性而言，以及就其在有限步数中的收敛性而言。我们还对这些算法的效率和执行速度与修复凸集的形状以及松弛参数值的相关性进行了数值研究。“

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

"A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting"

"The paper compares four variants of algorithms that solve the problem of Convex Feasibility using affine combinations of projections, two classical variants of Parallel Projection Method (PPM) and two modified variants that involve variable weight, in terms of their effectiveness in inpainting a convex polygon, as well as in terms of their convergence in a finite a number of step. We also present a numerical study of the dependence of the efficiency and the execution speed of these algorithms on the shape of the inpainted convex set, as well as on the values of the relaxation parameter."

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Carpathian Journal of Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.40

自引率

7.10%

发文量

审稿时长

>12 weeks

期刊介绍： Carpathian Journal of Mathematics publishes high quality original research papers and survey articles in all areas of pure and applied mathematics. It will also occasionally publish, as special issues, proceedings of international conferences, generally (co)-organized by the Department of Mathematics and Computer Science, North University Center at Baia Mare. There is no fee for the published papers but the journal offers an Open Access Option to interested contributors.