基于改进期望最大化和差分进化算法的多级图像阈值分割

E. Ehsaeyan, A. Zolghadrasli
{"title":"基于改进期望最大化和差分进化算法的多级图像阈值分割","authors":"E. Ehsaeyan, A. Zolghadrasli","doi":"10.1142/s0219843621500134","DOIUrl":null,"url":null,"abstract":"Multilevel image thresholding is an essential step in the image segmentation process. Expectation Maximization (EM) is a powerful technique to find thresholds but is sensitive to the initial points. Differential Evolution (DE) is a robust metaheuristic algorithm that can find thresholds rapidly. However, it may be trapped in the local optimums and premature convergence occurs. In this paper, we incorporate EM algorithm to DE and introduce a novel algorithm called EM+DE which overcomes these shortages and can segment images better than EM and DE algorithms. In the proposed method, EM estimates Gaussian Mixture Model (GMM) coefficients of the histogram and DE tries to provide good volunteer solutions to EM algorithm when EM converges in local areas. Finally, DE fits GMM parameters based on Root Mean Square Error (RMSE) to reach the fittest curve. Ten standard test images and six famous metaheuristic algorithms are considered and result on global fitness. PSNR, SSIM, FSIM criteria and the computational time are given. The experimental results prove that the proposed algorithm outperforms the EM and DE as well as EM+ other natural-inspired algorithms in terms of segmentation criteria.","PeriodicalId":312776,"journal":{"name":"Int. J. Humanoid Robotics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multilevel Image Thresholding Based on Improved Expectation Maximization (EM) and Differential Evolution Algorithm\",\"authors\":\"E. Ehsaeyan, A. Zolghadrasli\",\"doi\":\"10.1142/s0219843621500134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multilevel image thresholding is an essential step in the image segmentation process. Expectation Maximization (EM) is a powerful technique to find thresholds but is sensitive to the initial points. Differential Evolution (DE) is a robust metaheuristic algorithm that can find thresholds rapidly. However, it may be trapped in the local optimums and premature convergence occurs. In this paper, we incorporate EM algorithm to DE and introduce a novel algorithm called EM+DE which overcomes these shortages and can segment images better than EM and DE algorithms. In the proposed method, EM estimates Gaussian Mixture Model (GMM) coefficients of the histogram and DE tries to provide good volunteer solutions to EM algorithm when EM converges in local areas. Finally, DE fits GMM parameters based on Root Mean Square Error (RMSE) to reach the fittest curve. Ten standard test images and six famous metaheuristic algorithms are considered and result on global fitness. PSNR, SSIM, FSIM criteria and the computational time are given. The experimental results prove that the proposed algorithm outperforms the EM and DE as well as EM+ other natural-inspired algorithms in terms of segmentation criteria.\",\"PeriodicalId\":312776,\"journal\":{\"name\":\"Int. J. Humanoid Robotics\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Humanoid Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219843621500134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Humanoid Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219843621500134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多层图像阈值分割是图像分割过程中必不可少的步骤。期望最大化(EM)是一种寻找阈值的强大技术,但对初始点很敏感。差分进化算法是一种鲁棒的能快速找到阈值的元启发式算法。但是,它可能会陷入局部最优,出现过早收敛。本文将EM算法与DE相结合,提出了一种新的算法EM+DE,克服了EM和DE算法的不足,可以更好地分割图像。在该方法中,EM估计直方图的高斯混合模型(GMM)系数,DE试图在EM局部收敛时为EM算法提供良好的志愿解决方案。最后,基于均方根误差(Root Mean Square Error, RMSE)对GMM参数进行拟合,得到拟合曲线。考虑了10个标准测试图像和6种著名的元启发式算法,并得出了全局适应度的结果。给出了PSNR、SSIM、FSIM准则和计算时间。实验结果表明,该算法在分割标准上优于EM和DE以及EM+其他自然算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multilevel Image Thresholding Based on Improved Expectation Maximization (EM) and Differential Evolution Algorithm
Multilevel image thresholding is an essential step in the image segmentation process. Expectation Maximization (EM) is a powerful technique to find thresholds but is sensitive to the initial points. Differential Evolution (DE) is a robust metaheuristic algorithm that can find thresholds rapidly. However, it may be trapped in the local optimums and premature convergence occurs. In this paper, we incorporate EM algorithm to DE and introduce a novel algorithm called EM+DE which overcomes these shortages and can segment images better than EM and DE algorithms. In the proposed method, EM estimates Gaussian Mixture Model (GMM) coefficients of the histogram and DE tries to provide good volunteer solutions to EM algorithm when EM converges in local areas. Finally, DE fits GMM parameters based on Root Mean Square Error (RMSE) to reach the fittest curve. Ten standard test images and six famous metaheuristic algorithms are considered and result on global fitness. PSNR, SSIM, FSIM criteria and the computational time are given. The experimental results prove that the proposed algorithm outperforms the EM and DE as well as EM+ other natural-inspired algorithms in terms of segmentation criteria.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信