{"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}
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.