Otsu Image Segmentation Algorithm Based on Hybrid Fractional-Order Butterfly Optimization

IF 3.6 2区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Yu Ma, Ziqian Ding, Jing Zhang, Zhiqiang Ma
{"title":"Otsu Image Segmentation Algorithm Based on Hybrid Fractional-Order Butterfly Optimization","authors":"Yu Ma, Ziqian Ding, Jing Zhang, Zhiqiang Ma","doi":"10.3390/fractalfract7120871","DOIUrl":null,"url":null,"abstract":"To solve the drawbacks of the Otsu image segmentation algorithm based on traditional butterfly optimization, such as slow convergence speed and poor segmentation accuracy, this paper proposes hybrid fractional-order butterfly optimization with the Otsu image segmentation algorithm. G-L-type fractional-order differentiation is combined with the algorithm’s global search to improve the position-updating method, which enhances the algorithm’s convergence speed and prevents it from falling into local optima. The sine-cosine algorithm is introduced in the local search step, and Caputo-type fractional-order differentiation is used to avoid the disadvantages of the sine-cosine algorithm and to improve the optimization accuracy of the algorithm. By dynamically converting the probability, the ratio of global search to local search is changed to attain high-efficiency and high-accuracy optimization. Based on the 2-D grayscale gradient distribution histogram, the trace of discrete matrices between classes is chosen as the fitness function, the best segmentation threshold is searched for, image segmentation is processed, and three categories of images are chosen to proceed with the segmentation test. The experimental results show that, compared with traditional butterfly optimization, the convergence rate of hybrid fractional-order butterfly optimization with the Otsu image segmentation algorithm is improved by about 73.38%; meanwhile, it has better segmentation accuracy than traditional butterfly optimization.","PeriodicalId":12435,"journal":{"name":"Fractal and Fractional","volume":"42 27","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2023-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fractal and Fractional","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3390/fractalfract7120871","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the drawbacks of the Otsu image segmentation algorithm based on traditional butterfly optimization, such as slow convergence speed and poor segmentation accuracy, this paper proposes hybrid fractional-order butterfly optimization with the Otsu image segmentation algorithm. G-L-type fractional-order differentiation is combined with the algorithm’s global search to improve the position-updating method, which enhances the algorithm’s convergence speed and prevents it from falling into local optima. The sine-cosine algorithm is introduced in the local search step, and Caputo-type fractional-order differentiation is used to avoid the disadvantages of the sine-cosine algorithm and to improve the optimization accuracy of the algorithm. By dynamically converting the probability, the ratio of global search to local search is changed to attain high-efficiency and high-accuracy optimization. Based on the 2-D grayscale gradient distribution histogram, the trace of discrete matrices between classes is chosen as the fitness function, the best segmentation threshold is searched for, image segmentation is processed, and three categories of images are chosen to proceed with the segmentation test. The experimental results show that, compared with traditional butterfly optimization, the convergence rate of hybrid fractional-order butterfly optimization with the Otsu image segmentation algorithm is improved by about 73.38%; meanwhile, it has better segmentation accuracy than traditional butterfly optimization.
基于混合分数阶蝴蝶优化的大津图像分割算法
针对基于传统蝴蝶优化的Otsu图像分割算法收敛速度慢、分割精度差的缺点,本文提出了分数阶蝴蝶优化与Otsu图像分割算法的混合优化。将g - l型分数阶微分与算法的全局搜索相结合,改进了位置更新方法,提高了算法的收敛速度,避免了算法陷入局部最优。在局部搜索步骤中引入正弦余弦算法,并采用caputo型分数阶微分,避免了正弦余弦算法的缺点,提高了算法的优化精度。通过动态转换概率,改变全局搜索与局部搜索的比例,实现高效率、高精度的优化。在二维灰度梯度分布直方图的基础上,选取类间离散矩阵的迹线作为适应度函数,寻找最佳分割阈值,对图像进行分割处理,选择三类图像进行分割测试。实验结果表明,与传统的蝴蝶优化相比,Otsu图像分割算法混合分数阶蝴蝶优化的收敛速度提高了约73.38%;同时,该算法比传统的蝴蝶优化算法具有更好的分割精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Fractal and Fractional
Fractal and Fractional MATHEMATICS, INTERDISCIPLINARY APPLICATIONS-
CiteScore
4.60
自引率
18.50%
发文量
632
审稿时长
11 weeks
期刊介绍: Fractal and Fractional is an international, scientific, peer-reviewed, open access journal that focuses on the study of fractals and fractional calculus, as well as their applications across various fields of science and engineering. It is published monthly online by MDPI and offers a cutting-edge platform for research papers, reviews, and short notes in this specialized area. The journal, identified by ISSN 2504-3110, encourages scientists to submit their experimental and theoretical findings in great detail, with no limits on the length of manuscripts to ensure reproducibility. A key objective is to facilitate the publication of detailed research, including experimental procedures and calculations. "Fractal and Fractional" also stands out for its unique offerings: it warmly welcomes manuscripts related to research proposals and innovative ideas, and allows for the deposition of electronic files containing detailed calculations and experimental protocols as supplementary material.
×
引用
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学术官方微信