一种基于凸可行性的绘图算法并行化

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2018-09-01 DOI:10.1109/SYNASC.2018.00062

Liviu Octavian Mafteiu-Scai, Irina Maria Artinescu, Vlad Mafteiu-Scai

{"title":"一种基于凸可行性的绘图算法并行化","authors":"Liviu Octavian Mafteiu-Scai, Irina Maria Artinescu, Vlad Mafteiu-Scai","doi":"10.1109/SYNASC.2018.00062","DOIUrl":null,"url":null,"abstract":"Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallelizations of an Inpainting Algorithm Based on Convex Feasibility\",\"authors\":\"Liviu Octavian Mafteiu-Scai, Irina Maria Artinescu, Vlad Mafteiu-Scai\",\"doi\":\"10.1109/SYNASC.2018.00062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.\",\"PeriodicalId\":273805,\"journal\":{\"name\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2018.00062\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

图像恢复是目前一个非常常见的过程，主要包括通过改变某些区域或丢失的数据来恢复已经退化的图像，因此随着时间的推移，已经提出了许多算法。在这项工作中，提出了基于凸可行性的并行算法，用于图像划痕的修复。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Parallelizations of an Inpainting Algorithm Based on Convex Feasibility

Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.

求助全文

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

来源期刊

2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量