Salp Swarm Algorithm with Multilevel Thresholding Based Brain Tumor Segmentation Model

Biomedical image processing acts as an essential part of severalmedical applications in supporting computer aided disease diagnosis. MagneticResonance Image (MRI) is a commonly utilized imaging tool used tosave glioma for clinical examination. Biomedical image segmentation plays avital role in healthcare decision making process which also helps to identifythe affected regions in the MRI. Though numerous segmentation models areavailable in the literature, it is still needed to develop effective segmentationmodels for BT. This study develops a salp swarm algorithm with multi-levelthresholding based brain tumor segmentation (SSAMLT-BTS) model. Thepresented SSAMLT-BTS model initially employs bilateral filtering based onnoise removal and skull stripping as a pre-processing phase. In addition,Otsu thresholding approach is applied to segment the biomedical imagesand the optimum threshold values are chosen by the use of SSA. Finally,active contour (AC) technique is used to identify the suspicious regions in themedical image. A comprehensive experimental analysis of the SSAMLT-BTSmodel is performed using benchmark dataset and the outcomes are inspectedin many aspects. The simulation outcomes reported the improved outcomesof the SSAMLT-BTS model over recent approaches with maximum accuracyof 95.95%.

Optimal multilevel thresholding based on molecular kinetic theory optimization algorithm and line intercept histogram

Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computing time, and can be easily extended to multilevel thresholding. But when images contain salt-and-pepper noise, LIH Otsu method performs poorly. An improved LIH Otsu method(ILIH Otsu method) is presented, which can be more resistant to Gaussian noise and salt-and-pepper noise. Moreover, it can be easily extended to multilevel thresholding. In order to improve the efficiency, the optimization algorithm based on the kinetic-molecular theory(KMTOA) is used to determine the optimal thresholds. The experimental results show that ILIH Otsu method has stronger anti-noise ability than two-dimensional Otsu thresholding method(2-D Otsu method), LIH Otsu method, K-means clustering algorithm and fuzzy clustering algorithm.

A Context Sensitive Multilevel Thresholding Using Swarm Based Algorithms

In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding. These new energy based objective criterions are further combined with the proficient search capability of swarm based algorithms to improve the efficiency and robustness. The proposed multilevel thresholding approach accurately determines the optimal threshold values by using generated energy curve, and acutely distinguishes different objects within the multi-channel complex images. The performance evaluation indices and experiments on different test images illustrate that Kapur's entropy aided with differential evolution and bacterial foraging optimization algorithm generates the most accurate and visually pleasing segmented images.

A New Multilevel Thresholding Method Using Swarm Intelligence Algorithm for Image Segmentation

Thresholding is a popular image segmentation method that converts gray-level image into binary image. The selection of optimum thresholds has remained a challenge over decades. In order to determine thresholds, most methods analyze the histogram of the image. The optimal thresholds are often found by either minimizing or maximizing an objective function with respect to the values of the thresholds. In this paper, a new intelligence algorithm, particle swarm opti-mization (PSO), is presented for multilevel thresholding in image segmentation. This algorithm is used to maximize the Kapur’s and Otsu’s objective functions. The performance of the PSO has been tested on ten sample images and it is found to be superior as compared with genetic algorithm (GA).

Multi-verse Optimizer with Rosenbrock and Diffusion Mechanisms for Multilevel Threshold Image Segmentation from COVID-19 Chest X-Ray Images

Coronavirus Disease 2019(COVID-19)is the most severe epidemic that is prevalent all over the world.How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic.Moreover,it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images.As we all know,image segmentation is a critical stage in image processing and analysis.To achieve better image segmentation results,this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO.Then utilizes RDMVO to calculate the maximum Kapur’s entropy for multilevel threshold image segmentation.This image segmentation scheme is called RDMVO-MIS.We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS.First,RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions.Second,the image segmentation experiment was carried out using RDMVO-MIS,and some meta-heuristic algorithms were selected as comparisons.The test image dataset includes Berkeley images and COVID-19 Chest X-ray images.The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.

Multilevel Threshold Based Image Denoising in Curvelet Domain

In this paper, we propose a multilevel thresholding technique for noise removal in curvelet transform domain which uses cycle-spinning. Most of uncorrelated noise gets removed by thresholding curvelet coeffcients at lowest level, while correlated noise gets removed by only a fraction at lower levels, so we used multilevel thresholding on curvelet coe?cients. The threshold in the proposed method depends on the variance of curvelet coeffcients, the mean and the median of absolute curvelet coeffcients at a particular level which makes it adaptive in nature. Results obtained for 2-D images demonstrate an improved performance over other recent related methods available in literature.

改进?鱼优化算法和熵测度的图像多阈值分割

针对传统图像多阈值分割方法存在效率低、分割质量差等问题,提出一种改进?鱼优化算法并结合熵测度(weight lens remora optimization algorithm,WLROA)的图像多阈值分割方法。针对?鱼优化算法易陷入局部极值等缺陷,引入透镜成像反向学习策略,生成透镜反向解来增加种群多样性,进而提高算法跳出局部极值能力;提出一种自适应权重因子,对个体位置进行自适应扰动,提高算法探索能力。以最小化交叉熵作为优化目标,利用WLROA确定最小交叉熵并获得相应分割阈值。选取部分伯克利大学分割数据集图像和遥感图像测试提出算法的分割性能,测试结果表明,WLROA与其他知名算法相比具有更好的分割效果,能够有效实现复杂图像的精确处理。

Fuzzy Hybrid Coyote Optimization Algorithm for Image Thresholding

In order to address the problems of Coyote Optimization Algorithm in image thresholding,such as easily falling into local optimum,and slow convergence speed,a Fuzzy Hybrid Coyote Optimization Algorithm(here-inafter referred to as FHCOA)based on chaotic initialization and reverse learning strategy is proposed,and its effect on image thresholding is verified.Through chaotic initialization,the random number initialization mode in the standard coyote optimization algorithm(COA)is replaced by chaotic sequence.Such sequence is nonlinear and long-term unpredictable,these characteristics can effectively improve the diversity of the population in the optimization algorithm.Therefore,in this paper we first perform chaotic initialization,using chaotic sequence to replace random number initialization in standard COA.By combining the lens imaging reverse learning strategy and the optimal worst reverse learning strategy,a hybrid reverse learning strategy is then formed.In the process of algorithm traversal,the best coyote and the worst coyote in the pack are selected for reverse learning operation respectively,which prevents the algorithm falling into local optimum to a certain extent and also solves the problem of premature convergence.Based on the above improvements,the coyote optimization algorithm has better global convergence and computational robustness.The simulation results show that the algorithmhas better thresholding effect than the five commonly used optimization algorithms in image thresholding when multiple images are selected and different threshold numbers are set.

基于ISSA和积分图的二维熵图像多阈值分割快速算法

为提高二维熵图像多阈值分割的性能,使其能够满足工业使用当中的实时性要求,本文提出了基于改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)和积分图的二维熵图像多阈值分割快速算法。首先,引入麻雀搜索算法(Sparrow Search Algorithm,SSA)并对该算法的算法性能进行分析研究,针对SSA存在的全局搜索能力差、容易陷入局部最优解的缺点,提出了基于方差线性递减的高斯扰动策略和随机步长移动策略的改进麻雀搜索算法(ISSA)。接着,进一步地引入积分图方法,降低总信息熵的运算量,并将总信息熵作为ISSA的适应度函数进行最佳阈值寻优,提出了基于ISSA并结合积分图的二维熵图像多阈值分割快速算法。最后,使用该方法与现有分割算法进行对比实验,实验结果表明,本文方法提升了图像二维熵多阈值分割的分割效率,同时在工业应用场景仍能够获得相同的效果。

基于IMFO-Otsu的果实深度图像多阈值分割

为了解决传统果实图像进行阈值分割易受颜色、光照等因素影响的问题,提出一种基于改进飞蛾火焰算法(Improved Moth flame Optimization,IMFO)的多阈值分割算法(IMFO-Otsu)。算法在构建深度直方图后,根据多阈值Otsu准则获取最佳分割阈值。为了提高获取最佳阈值的计算效率,对多阈值Otsu准则进行剪枝处理,并使用提出的改进飞蛾火焰算法对算法进行加速。为验证IMFO-Otsu算法的效果,使用该算法对采集得到的果实图像进行多阈值分割,结果表明提出的算法具有良好的性能。由于提出的算法没有用到彩色图像的颜色信息且简单有效,能在夜间环境等复杂情况对果实识别与定位提供支持。

基于萤火虫算法的二维熵多阈值快速图像分割

提出了基于萤火虫算法的二维熵多阈值快速图像分割方法以改善分割复杂图像和多目标图像时存在计算量大、计算时间长的问题。首先,分析了二维熵阈值分割原理,将二维熵单阈值分割扩展到二维熵多阈值分割。然后,引入萤火虫算法的思想,研究了萤火虫算法的仿生原理和寻优过程;提出了基于萤火虫算法的二维熵多阈值快速图像分割方法。最后,使用该方法对典型图像进行阈值分割实验,并与二维熵穷举分割法、粒子群算法(PSO)二维熵多阈值分割法进行比较。实验结果表明:该方法在单阈值分割、双阈值分割和三阈值分割时分别比二维熵穷举分割法快3.91倍,1040.32倍和8128.85倍;另外,在阈值选取的准确性和计算时间方面均优于PSO二维熵多阈值分割法。结果显示,基于萤火虫算法的二维熵多阈值快速图像分割方法能快速有效地解决复杂图像和多目标图像的分割问题。

典型Otsu算法阈值比较及其SAR图像水域分割性能分析

遥感图像中水域呈现低灰度、灰度起伏小特性。该文从实时性出发,采用1维Otsu算法分割SAR图像。证明了两种典型Otsu分割算法的阈值关系,提出了分割性能评估方法,并通过实测SAR图像对比分析了多阈值分割与单阈值递归分割的水域分割性能。结果表明,与单阈值递归分割相比,多阈值分割能够更好地提取水域轮廓,且漏警率低,可应用于桥梁自动目标识别和景象匹配等方面。

一种邻域均值加权最大类间方差的阈值分割法

对应用广泛的阈值图像分割的最大类间方差法进行了研究,在深入分析了现有的Neighborhood Valley-Emphasis Method存在的问题的基础上,提出一种邻域均值加权最大类间方差的阈值分割法Neighborhood-Mean Valley-Emphasis Method.其核心思想是,对最大类间方差法进行邻域均值加权;根据灰度值出现的次数生成直方图,取每个灰度值的邻域区间,求得灰度值出现次数的邻域均值,同时求得类间方差,用邻域均值加权类间方差,使得阈值在类间方差最大且是直方图的极小点处取得,提高了算法的准确性,另一方面,邻域均值有均值滤波器的效果,增强了算法的抗噪性.实验结果表明,改进的最大类间方差法NeighborhoodMean Valley-Emphasis Method大大降低了因加权溢出而导致算法失效的可能性,扩大了适用范围,增强了鲁棒性.

快速递归多阈值分割算法

针对强调波谷邻域算法在目标区域相对于背景区域较小且其之间的波谷特征并不十分明显的情况下,无法获得正确阈值的问题,提出了一种基于波谷邻域信息和波谷波峰相对特征的全局阈值分割算法。本算法在最大类间方差(OTSU)算法的基础上以直方图中波谷邻域灰度值和波谷波峰灰度值的相对关系为权值,改善最大类间方差算法定位阈值的准确性,使算法所确定的阈值在直方图中具有较小的波谷波峰比值,即使最优阈值定位到与临近波峰具有较大高度差的波谷灰度值。为提高分割效率,本文以前述算法为基础,采用递归单阈值方式进行图像的多阈值分割。实验证明,对强调波谷邻域算法存在的问题本算法有明显的改善,且在多阈值分割的效果及运行时间方面本文算法均具有十分良好的表现。

基于广义反向粒子群与引力搜索混合算法的多阈值图像分割

提出了基于粒子群优化(PSO)与引力搜索(GSA)混合算法(PSOGSA)的多阈值图像分割方法来解决图像阈值搜寻过程中单一优化算法局部搜索能力不强的问题。提出了图像阈值分割领域中的广义反向学习策略,在阈值寻优过程中提高群体多样性,增强了全局搜索能力;采用了全局最优解的正态变异策略,扩展了全局最优的搜索区域,避免了算法的早熟收敛。在此基础上,实现了基于广义反向粒子群与引力搜索混合算法的多阈值图像分割方法。最后,使用本方法对复杂多目标图像进行了多阈值分割实验,并与引力搜索算法和萤火虫算法进行了比较。实验结果表明,本文方法的分割精度优于引力搜索算法与萤火虫算法,其分割目标函数值在连续运行时的标准差降低了90%以上,是一种精度高、稳定性强的多阈值图像分割方法。

一种用于抑制白噪声的分层复阈值算法

基于PD信号的复小波变换模极大值随尺度s的增加而增加,而白噪声的复小波变换模极大值随尺度s的增加而减小的特点,创建一种分层复阈值算法。将分层复阈值用于复小波变换对仿真PD信号的去噪,并与全局复阈值算法进行了比较。同时在对仿真PD信号去噪后的波形畸变研究中,为弥补波形相似性参数(NCC)的不足,提出一个新的描述波形相似程度参数——变化趋势参数(VTP),并结合去噪前后的信噪比(SNR)对去噪效果进行综合评价。将分层复阈值技术用于对实验室实测的模拟GIS超高频PD信号的去噪。结果表明,采用分层复阈值技术的复小波变换抑制白噪声的效果更好,在高信噪比(SNR)或噪声抑制比(NRR)的情况下,对信号的畸变也更小。

基于量子粒子群优化算法的最小交叉熵多阈值图像分割

首先提出了一种减少最小交叉熵适应度函数计算量的快速递推编程技术;然后采用量子粒子群优化法搜索获得图像最优多阈值,并用该阈值实现图像分割。实验分析结果表明,该方法具有实现阈值寻优速度快,最优解对应图像分割效果好的特点。

动态迁移和椒盐变异融合生物地理学优化算法的高维多阈值分割

针对高维多阈值图像分割中存在的多阈值搜索问题,提出了一种动态迁移和椒盐变异融合的生物地理学优化算法(BBOD)。首先,构建了一种基于动态扰动的迁移算子,对候选解中没有发生迁移操作的特征值添加一个动态的扰动因子,使种群的多样性增加,从而提高全局搜索能力;然后,创建了新型的变异算子,对待变异的特征值产生一个椒盐扰动,使该值在小范围内浮动,以便提高局部搜索能力和算法的收敛速度;最后,将该算法应用到基于最小交叉熵的图像高维多阈值分割中。高维多阈值分割实验结果表明,本文提出的BBOD算法能够获得最优的阈值向量,运行速度、性能指标均优于标准的生物地理学优化(BBO)算法,基于变异的生物地理学优化(BBOM)算法、FFA(Firefly Algorithm)和CSA(Cuckoo Search Algorithm),运行速度是FFA的5倍以上。该算法更适用于基于最小交叉熵的高维多阈值优化选择。

基于谱聚类的多阈值图像分割方法

阈值法是图像分割的一种重要方法,在图像处理与目标识别中广为应用。因此,如何确定阈值是图像分割的关键。提出了一种新的图像阈值分割方法,即通过采用新的相似度函数的谱聚类算法(Dcut)确定图像阈值。采用基于灰度级的权值矩阵代替常用的基于图像像素级的权值矩阵描述图像像素的关系,因而算法需要的存储空间及实现的复杂性与其它基于图的图像分割方法相比大大减少。实验表明,该方法分割图像的时间少,且能够单阈值和多阈值分割图像,与现有的阈值分割方法相比,其具有更为优越的分割性能。

自适应分层阈值的简化PCNN红外人体图像分割

针对红外人体图像中人体目标亮度分布不均匀且易与背景混叠等引起分割不完整的问题,提出一种自适应分层阈值的简化PCNN(SPCNN)红外人体图像分割方法.该方法摒弃了传统SPCNN模型中的动态阈值指数衰减下降机制,采用神经元点火区域与未点火区域的统计特性构建自适应分层阈值;同时结合神经元同步点火机制并引入最近邻均值聚类规则控制神经元点火,以达到较高的分割精度.在真实红外人体图像集上与几种图像分割方法进行对比的实验结果表明,文中方法能取得较优的分割效果以及较小的分类错误率,且与传统的SPCNN模型相比,文中的SPCNN模型参数的设置更加简化.