Image Segmentation of Brain MR Images Using Otsu’s Based Hybrid WCMFO Algorithm

In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.

Two-dimensional cross entropy multi-threshold image segmentation based on improved BBO algorithm

In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.When using BBO algorithm to optimize threshold,firstly,the elitist selection operator is used to retain the optimal set of solutions.Secondly,a migration strategy based on fusion of good solution and pending solution is introduced to reduce premature convergence and invalid migration of traditional migration operations.Thirdly,to reduce the blindness of traditional mutation operations,a mutation operation through binary computation is created.Then,it is applied to the multi-threshold image segmentation of two-dimensional cross entropy.Finally,this method is used to segment the typical image and compared with two-dimensional multi-threshold segmentation based on particle swarm optimization algorithm and the two-dimensional multi-threshold image segmentation based on standard BBO algorithm.The experimental results show that the method has good convergence stability,it can effectively shorten the time of iteration,and the optimization performance is better than the standard BBO algorithm.

改进沙猫群优化算法的2D-OTSU多阈值图像分割

针对传统多级阈值图像分割方法精度低、收敛速度慢的问题,提出一种改进的沙猫群优化算法(Improved Sand Cat Swarm Optimization, ISCSO)用于全局优化,并应用于2D-OTSU多阈值图像分割任务。通过使用Henon混沌映射和反向折射机制初始化种群,使得种群的分布更加均匀,提高搜索的起始状态,从而增加算法的全局搜索能力;采用非线性灵敏度更新公式来平衡搜索多样性和收敛精度;引入可变螺旋搜索策略改进位置更新算法,以确保算法具有较好的搜索多样性和跳出局部最优解的能力。选取6张测试图像对ISCSO算法进行2DOTSU多阈值图像分割实验,采用峰值信噪比(PSNR)、特征相似性指数(FSIM)和结构相似性指数(SSIM)对实验结果进行评价。实验结果表明,基于ISCSO算法的2D-OSTU多阈值图像分割方法在图像分割任务中85.2%的结果优于对比算法,具有较强的搜索精度和收敛速度,这证明了ISCSO算法在图像分割领域的有效性和潜力。

An Improved Jellyfish Algorithm for Multilevel Thresholding of Magnetic Resonance Brain Image Segmentations

Image segmentation is vital when analyzing medical images,especially magnetic resonance(MR)images of the brain.Recently,several image segmentation techniques based on multilevel thresholding have been proposed for medical image segmentation;however,the algorithms become trapped in local minima and have low convergence speeds,particularly as the number of threshold levels increases.Consequently,in this paper,we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm(JSA)(an optimizer).We modify the JSA to prevent descents into local minima,and we accelerate convergence toward optimal solutions.The improvement is achieved by applying two novel strategies:Rankingbased updating and an adaptive method.Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions.We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution;we allow a small amount of exploration to avoid descents into local minima.The two strategies are integrated with the JSA to produce an improved JSA(IJSA)that optimally thresholds brain MR images.To compare the performances of the IJSA and JSA,seven brain MR images were segmented at threshold levels of 3,4,5,6,7,8,10,15,20,25,and 30.IJSA was compared with several other recent image segmentation algorithms,including the improved and standard marine predator algorithms,the modified salp and standard salp swarm algorithms,the equilibrium optimizer,and the standard JSA in terms of fitness,the Structured Similarity Index Metric(SSIM),the peak signal-to-noise ratio(PSNR),the standard deviation(SD),and the Features Similarity Index Metric(FSIM).The experimental outcomes and the Wilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM,the PSNR,the objective values,and the SD;in terms of the SSIM,IJSA was competitive with the others.

A new level set model for cell image segmentation

In this paper we first determine three phases of cell images： background, cytoplasm and nucleolus according to the general physical characteristics of cell images, and then develop a variational model, based on these characteristics, to segment nucleolus and cytoplasm from their relatively complicated backgrounds. In the meantime, the preprocessing obtained information of cell images using the OTSU algorithm is used to initialize the level set function in the model, which can speed up the segmentation and present satisfactory results in cell image processing.

基于OTSU图像分割算法的碎米检测

碎米作为大米加工过程的常见产物,常会对产品的口感、味道产生影响,因此针对整米中碎米的有效筛分尤为重要。针对上述问题,该文建立基于大津法(maximal variance between clusters,OTSU)图像分割算法的逻辑回归模型用以检测整米中的碎米。将检测结果与国标法进行对比,结果表明逻辑回归模型的曲线线下面积(area under the curve,AUC)值为0.987,柯尔莫可洛夫-斯米洛夫(Kolmogorov-Smirnov,KS)值为0.909,0.5为最佳阈值;而国标法的AUC值为0.922,KS值为0.669,21为最佳阈值。该文所建立的逻辑回归模型的准确率、精确率、召回率及F1分数均高于国标法。此外,逻辑回归模型的AUC值比国标法的AUC值更接近于1,KS值也更高,表明逻辑回归模型能够更好地区分碎米与整米。长轴(x_(1))、面积(x_(2))、短轴(x_(3))与长短轴比(x_(4))4个特征参数都是模型中具有显著影响的因素,对应的线性关系为z=-139.97-5.35x_(1)+10.93x_(2)+2.86x_(3)+34.59x_(4)。

改进蜜獾算法优化OTSU的图像分割研究

群体智能算法结合图像分割技术已经成为图像处理领域中的新热点,传统的图像分割方法需要大量的人力和时间,蜜獾算法(honey badger algorithm,HBA)可以通过模拟蜜獾觅食的行为来执行优化任务,在寻找解决问题的过程中可以逐步逼近最优解来实现图像分割任务;通过反向学习策略改进蜜獾种群的初始化,提高种群多样性和分布平衡,从而提高算法的整体搜索能力;引入柯西变异因子,对算法计算得到的可行解进行扰动,使算法更易于跳出局部最优,增强算法的局部搜索能力和收敛精度;选取三幅测试图像进行分割验证,实验结果显示,融合改进蜜獾算法和二维OTSU算法得到的分割图像精度更高、效果更细致,验证了方法的有效性;综上所述,改进蜜獾算法具有更好的鲁棒性和泛化性,优化的二维OTSU算法可以更好地处理复杂场景和图像。

基于加权灰度图与混合阈值分割方法的光伏热斑检测

在光伏红外热图像中,热斑和部分高温工作区的亮度非常接近。在利用传统的阈值分割技术提取热斑时,往往会将工作区也一并分割出来,形成虚假热斑。结合Otsu算法和Sauvola算法的优点,提出了一种基于加权灰度图的混合阈值分割方法。通过对灰度图加权处理,降低工作区亮度,从而增强热斑与工作区的对比度,改善热斑的可视性。利用Otsu算法与Sauvola算法二值化灰度图,并根据二值图差异度计算混合阈值,以此消除虚假热斑的干扰。实验证明,该方法适用于检测存在高温工作区的光伏板热斑,能够精准有效地分割热斑。

果园环境下采摘机器人水果目标识别算法探究——以绿色阳光玫瑰葡萄为例

该文研究果园环境下绿色阳光玫瑰葡萄的果实图像分割和定位方法。在分析了顺光、逆光和夜间3种光照情况下的采集图像后,选取最能体现绿色葡萄果实的颜色分量作为分割算法的输入图像。利用最大类间方差法(OTSU)和支持向量机法(SVM)实现果实和背景区域的分割。实验结果对比表明,绿色葡萄在夜间的识别率高于晴天顺光和逆光的情况。比较2种算法的准确率,可以发现SVM算法在晴天顺光和逆光时的准确率更高,而OTSU算法在夜间情况时较高,达到了98.7%。

一种改进Canny算子的图像边缘检测算法

在移动机器人自主作业时,环境中往往存在障碍物,路径规划避障时要进行动态目标检测.Canny边缘检测算法可以与众多动态目标检测算法相结合,提高目标检测的效果.但是传统Canny边缘检测存在着自适应性不强,边缘检测可能不连续,或者检测虚假边缘的现象.本文提出了一种优化Canny边缘检测算法,通过改进的自适应中值滤波来预处理图像,对算法效率及对噪声点的处理做出了优化,紧接着增加梯度计算方向,最后结合改进的大津阈值分割法,提出了三阈值分割法代替原始的阈值分割法使图像边缘信息更加完整准确.仿真结果表明,该算法在边缘检测准确率上对比传统Canny边缘检测,Sobel算子与较新改进算法均有20%左右的提升,该算法优化了传统算法检测的连续性和准确率.

三维直方图重建和降维的Otsu阈值分割算法

针对三维Otsu阈值分割算法中因区域误分而产生的抗噪性差这一问题,提出了一种三维直方图重建和降维的Otsu阈值分割算法.该方法首先在详细分析三维直方图中噪声点分布的基础上,通过重建三维直方图,减弱了噪声干扰;然后将三维直方图区域划分由八分法改为二分法,使得阈值搜索的空间维度从三维降低到一维,减少了处理时间和存储空间.本文最后给出了算法的分割结果和运行时间,并与三维Otsu方法、二维分解法和二维斜分法进行对比.实验结果表明,本文算法的抗噪性更强,且分割效果更为理想,同时时间复杂度也远低于三维Otsu法.

基于边缘检测与Otsu的图像分割算法研究

Otsu算法作为图像分割领域的经典算法得到了广泛的应用,在其基础上发展起来的2维Otsu算法由于运算时间长、抗噪能力差,应用受到限制。为此,提出一种改进的Otsu算法。通过更改2维直方图的区域划分方式,分别运用Sobel,Log和Canny边缘检测算法与直线拟合法相结合,将图像的目标和背景区域限制在一对平行于对角线的界线内,使用噪声点的邻域均值代替其灰度值,利用2维Otsu斜分法将目标从背景中分割出来。实验结果表明,与传统2维Otsu算法及其改进算法相比,该算法不仅运算时间较短,而且具有较好的分割质量、抗噪性能和自适应能力。

二维直方图准分的Otsu图像分割及其快速实现

传统二维Otsu法主要由于对二维直方图采用主对角线区域概率和近似为1的假设等原因,以致分割结果不够准确.针对此问题,提出了一种二维直方图准分的Otsu快速图像分割方法.(1)准确选择邻域模板构建二维直方图并将Otsu阈值法用于此直方图上以便提高分割性能;(2)对二维直方图主对角线上的目标和背景两区域的Otsu公式中对应量准确取值使阈值选取更准确;(3)对二维直方图投影进行分析得到其特性,并证明三个定理的存在,利用此特性和三个定理导出新型、快速的递推算法来降低计算复杂度.实验结果表明:与当前二维Otsu阈值法相比,本文提出的方法分割更准确和抗噪性更强,而且其运行时间少,与当前二维Otsu斜分递推算法的运行时间相近.

基于积分图像的快速二维Otsu算法

Otsu自适应阈值算法是图像分割的经典方法之一,在其基础上发展起来的二维Otsu阈值算法却因为计算复杂而制约了其应用。本文针对二维Otsu的耗时瓶颈问题,引入积分图像简化了二维直方图最佳阈值搜索过程的计算复杂度,从而大大缩短了算法处理时间。实验结果表明,本文提出的算法在分割效果上与原始算法完全相同,但计算时间远远小于后者,具有很好的实时性。

基于双次Otsu算法的野外荔枝多类色彩目标快速识别

针对目前野外环境下多类目标识别速度偏慢,导致机器人视觉定位精度低和工作效率不高的难题,以野外环境下成熟荔枝的多类色彩目标识别为例,提出了一种双次Otsu分割算法对多类色彩目标进行识别。首先为了提高算法的效率,改进了传统的Otsu算式;然后对目标色彩图像的背景、果梗、果实分别用改进的Otsu算法进行粗分割和细分割。最后通过与K-均值聚类(K-means)算法、模糊C均值聚类(FCM)算法、Otsu和K-means结合算法、Otsu和FCM结合算法这4种算法进行对比,双次Otsu算法从分割质量及其正确分割率、运行时间、稳定性3方面都优于其他4种算法。实验结果表明,双次Otsu算法对色彩目标的成熟荔枝识别的时间少于0.2 s。

改进的Otsu算法在图像分割中的应用

针对二维Otsu自适应阈值算法计算复杂度高的问题,提出一种新的快速有效的Otsu图像分割改进算法。该算法通过求两个一维Otsu法的阈值来代替传统的二维Otsu法的分割阈值,使得分割的计算复杂度从O(L4)降到O(L)。为保证分割对象的完整性,算法引入类内最小离散度的概念,并通过遗传算法实现对参数的自动优化。理论分析和实验结果表明本算法计算速度不仅优于原二维Otsu算法,而且分割效果较好。

基于幂次变换的SAR图像Otsu分割法

通过分析合成孔径雷达(synthetic aperture radar,SAR)目标切片图像的散射特性,提出一种适用于SAR目标识别的目标切片图像分割算法。算法首先对SAR图像做相干斑滤波,通过邻域平滑处理,提高背景区域和目标区域像素幅值一致性。然后自适应地选取变换幂次,对滤波后的SAR图像做幂次变换,以进一步增强目标区域像素幅值一致性。最后直接利用一维Otsu法对变换后的图像进行分割处理。实验表明,该算法对不同散射特性的目标切片图像都能够实现较为准确的分割,且计算复杂度小,利于工程应用。

扩展的Otsu最优阈值图像分割的实现方法

基于付忠良等人提出的扩展的Otsu最优阈值图像分割方法,提出了遗传算法的解决方案,并给出了遗传算法中基本参数的设定.基于图像的像素方差信息,利用遗传算法全局搜索图像的单阈值和双阈值,这样不但缩短了计算时间,而且具有遗传算法鲁棒性和自适应的特点,比传统的Otsu方法有明显的优点.

基于显著性的OTSU局部递归分割算法

针对OTSU方法的局限性 ,提出了一种基于显著性的OTSU局部递归分割算法 .该算法的思路是把一次OTSU分割得到的目标区域作为新的图像进行下一次OTSU分割 ,依次递归下去 ,直到满足一定条件为止 ,然后把每次分割得到的目标区域按照一定加权原则累加起来 ,得到分割结果图像 .实验结果表明 ,在不同的冷背景下 ,基于显著性的OTSU局部递归分割算法能够稳定地实现目标分割提取 。

基于小概率策略的Otsu图像分割方法

Otsu自适应阈值法是一种经典的图像阈值分割方法,在其基础上发展起来的2维Otsu法及其改进算法由于存在计算(或空间)复杂度较高、抗噪能力差、难以扩展到多阈值等不足而制约了其应用。该文针对2维Otsu法的不足,将噪声点的出现视为小概率事件,用噪声点的邻域均值代替其灰度值,将噪声点转换为目标(或背景)像素,减少了图像中的噪声点数量;继而直接采用1维Otsu法进行分割,以较小的代价获得良好的分割效果。算法分析及测试实验表明:与现有2维Otsu法相比,该算法在复杂度、抗噪性、多阈值扩展性等方面都有明显改善。