基于口腔图像的分割算法的研究

针对传统分割算法难以解决多目标分割等问题,提出了一种改进的一维Kapur熵多阈值分割算法.该算法依据Kapur熵阈值选择原理,应用图像灰度直方图信息,利用迭代合并和选择方法建立口腔图像中的阈值分割模型,解决了图像分割中阈值的自动获取问题和多阈值并行选择问题,实现了口腔图像中牙齿和病灶的分离.形状准则和一致性准则评价方法证明了该算法在抗噪声方面明显优于自适应阈值方法.获得的分割结果较好地保留了图像的灰度信息和边缘信息,为后续的图像分析和诊断工作提供了保证.     

基于改进共生生物搜索算法的林火图像多阈值分割

针对传统多阈值分割方法计算复杂度随着阈值个数的增加而增长,以及对给定图像进行多阈值分割操作时效率很低等问题,提出了一种基于共生生物搜索（SOS）算法结合Kapur熵的多阈值分割方法。首先将精英反策略（EOBL）引入到SOS算法的共栖阶段,从而改善传统SOS算法处理复杂优化问题时易陷入局部最优的问题;然后引入莱维飞行策略扩大SOS算法的的搜索范围,增强其搜索轨迹的随机性;最终将得到的改进共生生物搜索（MSOS）算法应用到林火图像最佳阈值的选取问题上。实验结果表明,与粒子群优化算法、和声搜索算法、蝙蝠算法等对比算法相比,所提算法能更好地分割图像,在实际工程问题中具有一定的实用性和价值。     

改进萤火虫优化算法的Renyi熵污油图像分割

针对传统Renyi熵方法在分割污油图像时存在图片差距大、无法根据不同图片进行最优分割的问题,提出改进萤火虫算法对二维Renyi熵分割算法中的α值进行寻优来解决上述问题。分析了采集的污油图片特点以及对污油图片进行分割的必要性;针对多目标寻优精度不高和后期收敛速度较慢的问题,对萤火虫算法进行了改进,并对初始萤火虫位置进行混沌优化处理,使结果达到全局最优;利用基于改进萤火虫算法的Renyi熵图像分割算法对采集的污油图片进行阈值分割实验,并与二维Renyi熵分割、粒子群算法(PSO)Renyi熵分割方法进行比较。实验结果表明:本文提出的算法可以有效地对污油区域进行分割,能够快速地实现复杂图像的精确处理。     

基于自适应CPSO算法的二维模糊熵图像阈值分割

由于PSO算法会出现虚假收敛或者早熟等现象,提出了一种自适应混沌粒子群算法(ACPSO)及其在图像分割中的应用。首先提出了一种改进的自适应粒子群优化算法(IAPSO)。然后在IAPSO的基础上,加入了混沌优化方法,用混沌变量来初始化粒子的位置和速度,并用新的无限折叠混沌映射对算法进行混沌变异,从当前群体中择优选择部分粒子进行混沌优化。最后将ACPSO算法应用到图像分割中。通过与最大模糊Shannon熵阈值分割法、基于基本PSO的最大模糊Shannon熵阈值分割法进行对比,验证了基于自适应CPSO算法的二维模糊熵阈值图像分割方法的性能更好。     

改进PSO算法在二维最佳阈值图像分割中的应用

针对二维熵图像分割在求取最佳阈值时存在计算量大及粒子群算法容易陷入局部最优、运算速度慢等问题,提出了改进的粒子群优化算法的二维熵图像分割方法。该方法是在雁群启示的粒子群算法基础上,对速度公式进行改进,并引入随机扰动策略,从两个方面同时改进以提高算法的收敛速度,以及克服局部极值的能力。仿真结果表明,将该方法用于阈值寻优减少了搜索时间,提高了收敛速度,强化了图像处理的实时性。     

基于遗传算法的最佳熵阈值的图像分割

Kapur等人提出的最佳熵阈值的图像分割具有很多优点,但同时也需要大量的运算时间,限制了其实际的应用范围,且最佳熵阈值的确定是一有待解决的问题,文章将遗传算法应用于最佳熵阈值的确定中,提出了相应的算法并用于图像分割,仿真结果表明,在设定了合适的遗传算子后,遗传算法不仅可以实现正确的图像分割,并且使得分割速度大大提高。     

基于Curvelet变换和多目标粒子群的混合熵MRI图像多阈值分割

针对因噪声干扰多、灰度不均匀、目标边界模糊导致的核磁共振成像（MRI）图像难以精确分割的问题,提出了一种基于Curvelet变换和多目标粒子群（MOPSO）的混合熵MRI图像多阈值分割算法。首先,对待分割MRI图像进行Curvelet分解,提取低频子带和高频细节子带构建概貌-细节灰度级矩阵模型,以提高算法的目标细节表示能力;其次,同时考虑目标与背景的类间差异性与类内均匀性,将提出的二维多阈值倒数熵和倒数灰度熵组合定义为混合熵,作为多目标粒子群算法的目标函数,协同搜索得到最优的分割多阈值,以实现MRI图像的精确分割;最后,为提高算法的求解速度,提出了二维倒数熵和倒数灰度熵多阈值选取的梯度算法。实验结果表明：与二维tsallis熵、自动细菌觅食分割法（ABF）和改进的Otsu多阈值分割算法相比,所提方法对灰度不均和含噪的MRI图像具有更好的适应性,分割结果更为精确。     

动态权重的蝙蝠算法在图像分割中的应用研究

传统的最小交叉熵阈值分割法（MCET）采用穷举的搜索形式，存在计算复杂度大、分割效率低的缺点，在很大程度上限制了该方法的应用。针对最小交叉熵分割法存在的不足，提出采用改进蝙蝠算法（BA）来搜索阈值的最优解。对BA算法中的权重参数做自适应调整，将随着迭代次数变化而变化的时变惯性权重策略应用于BA算法更新公式，给出三种不同的改进策略解决原始BA算法在靠近最优解时收敛速度下降的问题。将改进后的最优BA算法（IBA）应用于最小交叉熵多阈值图像分割中，与基本BA算法、改进的粒子群优化算法（IPSO）、模糊聚类方法（FC）三种方法进行对比性实验。实验结果表明，提出的IBA算法运算速度和分割精度效果明显提升。     

基于改进粒子群算法的阈值图像分割

针对基本粒子群算法目前存在的收敛速度过慢且容易于陷入局部极值等方面问题,提出根据蜂群算法的领域搜索思想,改变算法中粒子领域结构。通过借鉴蜂群的领域搜索策略解决粒子群算法陷入局部极值的问题,提高收敛速度。并将改进后粒子群算法应用于阈值图像分割中,仿真结果表明改进算法在图像阈值分割中减少阈值的寻优时间,优化收敛精度,提高图像处理的实时性和精度性。     

基于改进鱼群算法的多阈值图像分割

为了实现图像的有效分割,提出了一种基于改进鱼群算法的多阈值图像分割方法。引入领域搜索的思想对基本人工鱼群算法做了进一步改进;然后对最大熵函数进行全局优化,改进后的算法能够根据人工鱼的个体适应度大小和种群的分散程度自动调整鱼群控制参数,在保证群体多样性的同时加快了算法的收敛速度;最后得到分割图像的最佳阈值,克服了基本鱼群算法后期收敛性差、易陷入局部最优等问题。实验结果表明,所提算法能够获得较稳定、快速和准确的图像分割。     

量子遗传算法在指纹图像分割中的应用

提出了一种基于量子遗传算法(QGA)的指纹图像分割改进方法.这种方法利用量子遗传算法种群多样性好,收敛速度快的特点,将基于量子遗传算法的阈值分割方法与方向图法相结合对指纹图像进行分割.实验结果表明,QGA在指纹图像阈值分割中的速度和精度优于改进的自适应遗传算法和其它一些传统算法,是一种有效的图像分割方法.     

细胞膜机制萤火虫算法优化多阈值Otsu图像分割

图像阈值分割是将灰度图像转换为二值图像的常用图像分割方式.经典多阈值Otsu算法对复杂图像进行分割取得了很好的效果,但是其采用穷举方法来寻找最优阈值是非常耗时的.针对这一问题,本文提出了一种基于细胞膜和自适应步长萤火虫混合优化算法的多阈值Otsu图像分割方法.利用萤火虫算法的启发式搜索来寻找图像分割的最优阈值很好地降低了算法的时间复杂度,并且在萤火虫算法中混合细胞膜算法很好地解决了萤火虫算法的"早熟"现象.实验结果表明,与经典多阈值Otsu法和萤火虫算法优化多阈值Otsu法相比,本文提出的算法具有更高的收敛速度和更好的图像分割效果,并且有效解决了萤火虫算法易陷入局部最优的问题.     

改进的遗传算法在医学图像中的应用

针对标准的遗传算法（ GA）在优化Otsu法求取图像阈值时出现收敛速度慢、易早熟等问题,提出了一种改进的GA用于图像分割。该算法根据种群不同的进化代数和个体适应度的大小,动态地调整精英选择策略和遗传算子,从而提高了算法的收敛速度、得到了范围稳定的图像分割阈值,且保持了种群多样性。将该算法应用于医学图像分割,实验结果表明：该算法可以对医学图像进行分割且效果明显。     

Kapur’s entropy based optimal multilevel image segmentation using Crow Search Algorithm

Image segmentation is an essential part of image analysis, which has a direct impact on the quality of image analysis results. Thresholding is one of the simplest and widely used methods for image segmentation. Thresholding can be either bi-level, which involves partitioning of an image into two segments, or multilevel, which partitions an image into multiple segments using multiple thresholds values. This paper focuses on multilevel thresholding. A good segmentation scheme through multilevel thresholding identifies suitable threshold values to optimize between-class variance or entropy criterion. For such optimizations, nature inspired metaheuristic algorithms are commonly used. This paper presents a Kapur’s entropy based Crow Search Algorithm (CSA) to estimate optimal values of multilevel thresholds. Crow Search Algorithm is based on the intelligent behavior of crow flock. Crow Search Algorithm have shown better results because of less number of parameters, no premature convergence, and better exploration–exploitation balance in the search strategy. Kapur’s entropy is used as an objective function during the optimization process. The experiments have been performed on benchmarked images for different threshold values (i.e. 2, 4, 8, 16, 32 thresholds). The proposed method has been assessed and performance is compared with well-known metaheuristic optimization methods like Particle Swarm Optimization (PSO), Differential Evolution (DE), Grey Wolf Optimizer (GWO), Moth-Flame Optimization (MFO) and Cuckoo Search (CS). Experimental results have been evaluated qualitatively and quantitatively by using well-performed evaluation methods namely PSNR, SSIM, and FSIM. Computational time and Wilcoxon p-type value also compared. Experimental results show that proposed algorithm performed better than PSO, DE, GWO, MFO and CS in terms of quality and consistency.     

Modified bacterial foraging algorithm based multilevel thresholding for image segmentation

Multilevel thresholding is one of the most popular image segmentation techniques. In order to determine the thresholds, most methods use the histogram of the image. This paper proposes multilevel thresholding for histogram-based image segmentation using modified bacterial foraging (MBF) algorithm. To improve the global searching ability and convergence speed of the bacterial foraging algorithm, the best bacteria among all the chemotactic steps are passed to the subsequent generations. The optimal thresholds are found by maximizing Kapur's (entropy criterion) and Otsu's (between-class variance) thresholding functions using MBF algorithm. The superiority of the proposed algorithm is demonstrated by considering fourteen benchmark images and compared with other existing approaches namely bacterial foraging (BF) algorithm, particle swarm optimization algorithm (PSO) and genetic algorithm (GA). The findings affirmed the robustness, fast convergence and proficiency of the proposed MBF over other existing techniques. Experimental results show that the Otsu based optimization method converges quickly as compared with Kapur's method.     

Oppositional symbiotic organisms search optimization for multilevel thresholding of color image

Selection of optimal threshold is the most crucial issue in threshold-based segmentation. In case of color image, this task is become challenging, because conventional color image segmentation has computational complexity and also it suffers from lack of accuracy. Various techniques such as threshold based, region growing, edge detection, graph cut, pixel classification, neural network, active contour, gray level co-occurrence matrix are proposed so far for image segmentation in the literature. Out of them, threshold-based segmentation is popular for its simplicity. To address the problem of color image segmentation, we propose an enhanced version of metaheuristic optimization algorithm called Opposition based Symbiotic Organisms Search (OSOS) to solve multilevel image thresholding technique for color image segmentation by introducing opposition based learning concepts to accelerate the convergence rate and enhance the performance of standard symbiotic organisms search (SOS). The performance of the proposed OSOS based algorithm is investigated thoroughly and compared with some existing techniques like Cuckoo Search (CS), BAT algorithm (BAT), artificial bee colony (ABC) and particle swarm optimization (PSO). The comparison is made by applying the algorithm to a set of color images taken from a well-known benchmark dataset (Berkeley Segmentation Dataset (BSDS)) and some of the color images collected for the COCO dataset. It is observed from the results that the performance of the OSOS based algorithm is promising with respect to standards SOS and others in terms of the values of objective functions as well as the values of some well-defined quality metrics such as peak signal-to-noise ratio (PSNR), structure similarity index (SSIM) and feature similarity index (FSIM). The results of the proposed algorithm may encourage the scientists and engineers to apply it into pattern recognition problems.     

A novel local contrast fusion-based fuzzy model for color image multilevel thresholding using grasshopper optimization

The segmentation process is considered the significant step of an image processing system due to its extreme inspiration on the subsequent image analysis. Out of various approaches, thresholding is one of the most popular schemes for image segmentation. In segmentation, image pixels are arranged in various regions based on their intensity levels. In this paper, a straightforward and efficient fusion-based fuzzy model for multilevel color image segmentation using grasshopper optimization algorithm (GOA) has been proposed. Thresholding based segmentation lacks accuracy in segmenting the ambiguous images due to their complex characteristics, uncertainties and inherent fuzziness. However, the fuzzy entropy resolves these problems, but it is unable for segmenting at higher levels and also the complexity level for selecting suitable thresholds is high. The selection of metaheuristic GOA reduces this problem by selecting optimal threshold values. Therefore, to increase the quality of the segmented image, a simple and effective multilevel thresholding method is exploited by using the concept of fusion which is based on the local contrast. Experimental outputs demonstrate that fusion-based multilevel thresholding is better than most specific segmentation methods and can be validated by comparing the different numerical parameters. Experiments on standard daily-life color and satellite images are conducted to prove the effectiveness of the proposed scheme.     

基于WFSOA的2D-Otsu钢轨缺陷图像分割方法

针对二维最大类间方差阈值法(2D-Otsu)抗噪性较弱、计算时间较长的问题,文中提出了一种基于随机权重及异步价值因子取值的人群搜索算法,并将其应用于2D-Otsu中对钢轨缺陷图像进行分割。该算法采用随机权重加快收敛速度,采用异步价值因子提高搜索能力,有利于全局收敛到最优值。根据测试函数分析,WFSOA算法能够快速收敛,寻优值结果精度高,收敛时间短,算法稳定性好。在钢轨缺陷图像分割中,将2D-Otsu的迹函数作为WFSOA的目标函数,实验结果表明图像检测实时性高,对表面灰度不匀或生锈的钢轨缺陷分割结果清晰,有效降低了钢轨缺陷误检率和漏检率,在计算时间上仅占2D-Otsu算法的2%,可满足实际工程对实时性的需求。     

A multi-threshold segmentation approach based on Artificial Bee Colony optimization

This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is an evolutionary algorithm inspired by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1-D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. In the model, each Gaussian function represents a pixel class and therefore a threshold point. Unlike the Expectation-Maximization (EM) algorithm, the ABC method shows fast convergence and low sensitivity to initial conditions. Remarkably, it also improves complex time-consuming computations commonly required by gradient-based methods. Experimental results over multiple images with different range of complexity validate the efficiency of the proposed technique with regard to segmentation accuracy, speed, and robustness. The paper also includes an experimental comparison to the EM and to one gradient-based method which ultimately demonstrates a better performance from the proposed algorithm.