改进的泊松MAP算法用于更好的图像反卷积

Z. Al-Ameen, Zainab Younis
{"title":"改进的泊松MAP算法用于更好的图像反卷积","authors":"Z. Al-Ameen, Zainab Younis","doi":"10.1109/CyberneticsCom55287.2022.9865641","DOIUrl":null,"url":null,"abstract":"Captured images are usually obtained unclear and blurry. Image deconvolution algorithms are normally applied to get clearer images from their unclear versions. Research related to this field has tremendously grown in the past years due to the increased demand for top-quality images. The maximum a posteriori (MAP) concept has been used previously for image deconvolution. Accordingly, the Poisson MAP is a simple structure iterative algorithm that was proposed for image deconvolution. Iterative means that it needs many repetitions to deliver the output image. The repetitive procedure consumes time and involves more computational costs that can be avoided. Therefore, this algorithm is modified by utilizing two non-complex acceleration factors so that the output is obtained by using fewer iterations, making the algorithm runs faster. The improved algorithm is tested intensively with various unclear images, as well as it is compared with its original version, and the outcomes are evaluated using two evaluation methods (i.e., gradient information with features (GI-F) and run-time). From performing various tryouts, the original algorithm required an average of 36 iterations and an average runtime of 0.49 seconds, while the proposed algorithm required an average of 15 iterations and an average runtime of 0.28 seconds to produce better quality results. Hence, the proposed algorithm has shown better performances than its original version by providing better-acutance results rapidly.","PeriodicalId":178279,"journal":{"name":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved Poisson MAP Algorithm for Better Image Deconvolution\",\"authors\":\"Z. Al-Ameen, Zainab Younis\",\"doi\":\"10.1109/CyberneticsCom55287.2022.9865641\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Captured images are usually obtained unclear and blurry. Image deconvolution algorithms are normally applied to get clearer images from their unclear versions. Research related to this field has tremendously grown in the past years due to the increased demand for top-quality images. The maximum a posteriori (MAP) concept has been used previously for image deconvolution. Accordingly, the Poisson MAP is a simple structure iterative algorithm that was proposed for image deconvolution. Iterative means that it needs many repetitions to deliver the output image. The repetitive procedure consumes time and involves more computational costs that can be avoided. Therefore, this algorithm is modified by utilizing two non-complex acceleration factors so that the output is obtained by using fewer iterations, making the algorithm runs faster. The improved algorithm is tested intensively with various unclear images, as well as it is compared with its original version, and the outcomes are evaluated using two evaluation methods (i.e., gradient information with features (GI-F) and run-time). From performing various tryouts, the original algorithm required an average of 36 iterations and an average runtime of 0.49 seconds, while the proposed algorithm required an average of 15 iterations and an average runtime of 0.28 seconds to produce better quality results. Hence, the proposed algorithm has shown better performances than its original version by providing better-acutance results rapidly.\",\"PeriodicalId\":178279,\"journal\":{\"name\":\"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberneticsCom55287.2022.9865641\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberneticsCom55287.2022.9865641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

捕获的图像通常是不清晰和模糊的。图像反卷积算法通常用于从不清晰的版本中获得更清晰的图像。由于对高质量图像的需求增加,与该领域相关的研究在过去几年中有了巨大的增长。最大后验(MAP)概念已被用于图像反卷积。因此,泊松MAP算法是一种结构简单的图像反卷积迭代算法。迭代意味着它需要多次重复来传递输出图像。重复的过程消耗时间,涉及更多可以避免的计算成本。因此,利用两个非复加速因子对该算法进行改进,使迭代次数减少,得到输出,使算法运行速度加快。改进后的算法在各种不清晰的图像上进行了大量的测试,并与原始版本进行了比较,并使用两种评估方法(带特征的梯度信息(GI-F)和运行时)对结果进行了评估。通过进行各种测试,原始算法平均需要36次迭代,平均运行时间为0.49秒,而提出的算法平均需要15次迭代,平均运行时间为0.28秒,以产生更好的质量结果。因此,该算法在快速提供更好的锐度结果方面表现出比原始算法更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved Poisson MAP Algorithm for Better Image Deconvolution
Captured images are usually obtained unclear and blurry. Image deconvolution algorithms are normally applied to get clearer images from their unclear versions. Research related to this field has tremendously grown in the past years due to the increased demand for top-quality images. The maximum a posteriori (MAP) concept has been used previously for image deconvolution. Accordingly, the Poisson MAP is a simple structure iterative algorithm that was proposed for image deconvolution. Iterative means that it needs many repetitions to deliver the output image. The repetitive procedure consumes time and involves more computational costs that can be avoided. Therefore, this algorithm is modified by utilizing two non-complex acceleration factors so that the output is obtained by using fewer iterations, making the algorithm runs faster. The improved algorithm is tested intensively with various unclear images, as well as it is compared with its original version, and the outcomes are evaluated using two evaluation methods (i.e., gradient information with features (GI-F) and run-time). From performing various tryouts, the original algorithm required an average of 36 iterations and an average runtime of 0.49 seconds, while the proposed algorithm required an average of 15 iterations and an average runtime of 0.28 seconds to produce better quality results. Hence, the proposed algorithm has shown better performances than its original version by providing better-acutance results rapidly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信