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.

Review of Theory and Methods of Image Segmentation

Image segmentation refers to the technique and process of partitioning a digital image into multiple segments based on image characteristics so as to extract the object of interest from it. It is a key step from image processing to image analysis. In the mid-1950s, people began to study image segmentation. For decades, various methods for image segmentation have been proposed. In this paper, traditional image segmentation methods and some new methods appearing in recent years were reviewed. Thresholding segmentation methods, region-based, edge detection-based and segmentation methods based on specific theoretical tools were introduced in detail.

IMAGE ANALYSIS BASED ON EDGE DETECTION TECHNIQUES

A method that incorporates edge detection technique, Markov Random field (MRF), watershed segmentation and merging techniques was presented for performing image segmentation and edge detection tasks. It first applies edge detection technique to obtain a Difference In Strength (DIS) map. An initial segmented result is obtained based on K means clustering technique and the minimum distance. Then the region process is modeled by MRF to obtain an image that contains different intensity regions. The gradient values are calculated and then the watershed technique is used. DIS calculation is used for each pixel to define all the edges (weak or strong) in the image. The DIS map is obtained. This help as priority knowledge to know the possibility of the region segmentation by the next step (MRF), which gives an image that has all the edges and regions information. In MRF model, gray level l , at pixel location i , in an image X , depends on the gray levels of neighboring pixels. The segmentation results are improved by using watershed algorithm. After all pixels of the segmented regions are processed, a map of primitive region with edges is generated. The edge map is obtained using a merge process based on averaged intensity mean values. A common edge detectors that work on (MRF) segmented image are used and the results are compared. The segmentation and edge detection result is one closed boundary per actual region in the image.

IMAGE SEGMENTATION BASED ON MARKOV RANDOM FIELD AND WATERSHED TECHNIQUES

This paper presented a method that incorporates Markov Random Field(MRF), watershed segmentation and merging techniques for performing image segmentation and edge detection tasks. MRF is used to obtain an initial estimate of x regions in the image under process where in MRF model, gray level x , at pixel location i , in an image X , depends on the gray levels of neighboring pixels. The process needs an initial segmented result. An initial segmentation is got based on K means clustering technique and the minimum distance, then the region process in modeled by MRF to obtain an image contains different intensity regions. Starting from this we calculate the gradient values of that image and then employ a watershed technique. When using MRF method it obtains an image that has different intensity regions and has all the edge and region information, then it improves the segmentation result by superimpose closed and an accurate boundary of each region using watershed algorithm. After all pixels of the segmented regions have been processed, a map of primitive region with edges is generated. Finally, a merge process based on averaged mean values is employed. The final segmentation and edge detection result is one closed boundary per actual region in the image.

A Multiscale Approach to Automatic Medical Image Segmentation Using Self-Organizing Map

In this paper, a new medical image classification scheme is proposed using selforganizing map (SOM) combined with multiscale technique. It addresses the problem of the handling of edge pixels in the traditional multiscale SOM classifiers. First, to solve the difficulty in manual selection of edge pixels, a multiscale edge detection algorithm based on wavelet transform is proposed. Edge pixels detected are then selected into the training set as a new class and a mu1tiscale SoM classifier is trained using this training set. In this new scheme, the SoM classifier can perform both the classification on the entire image and the edge detection simultaneously. On the other hand, the misclassification of the traditional multiscale SoM classifier in regions near edges is greatly reduced and the correct classification is improved at the same time.

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

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

ON MARKOV RANDOM FIELD MODELS FOR SEGMENTATION OF NOISY IMAGES

Markov random field(MRF) models for segmentation of noisy images are discussed. According to the maximum a posteriori criterion, a configuration of an image field is regarded as an optimal estimate of the original scene when its energy is minimized. However, the minimum energy configuration does not correspond to the scene on edges of a given image, which results in errors of segmentation. Improvements of the model are made and a relaxation algorithm based on the improved model is presented using the edge information obtained by a coarse-to-fine procedure. Some examples are presented to illustrate the applicability of the algorithm to segmentation of noisy images.

An Effective Method of Threshold Selection for Small Object Image

The image segmentation difficulties of small objects which are much smaller than their background often occur in target detection and recognition. The existing threshold segmentation methods almost fail under the circumstances. Thus, a threshold selection method is proposed on the basis of area difference between background and object and intra-class variance. The threshold selection formulae based on one-dimensional (1-D) histogram, two-dimensional (2-D) histogram vertical segmentation and 2-D histogram oblique segmentation are given. A fast recursive algorithm of threshold selection in 2-D histogram oblique segmentation is derived. The segmented images and processing time of the proposed method are given in experiments. It is compared with some fast algorithms, such as Otsu, maximum entropy and Fisher threshold selection methods. The experimental results show that the proposed method can effectively segment the small object images and has better anti-noise property.

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.

基于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)。

月球探测器鲁棒环形山检测及光学导航方法

针对月球探测器环形山检测方法受光照影响、鲁棒性差的问题,本文提出一种基于极大熵阈值三值化的鲁棒环形山检测算法。采用不同滤波核对图像进行去噪平滑,然后对处理后的图像进行极大熵阈值分割、将图像信息三值化,去除图像对光源的敏感性,同时最大程度保留图像信息;提出一种归一化多指标约束环形山匹配和拟合方法完成环形山提取,将环形山提取算法应用于光学导航中进行打靶实验验证算法实时性表现。仿真结果表明:与传统基于形态学或自适应边缘检测的方法相比,本文方法在较大尺度条件下提取出连续、光滑的环形山边缘,有效环形山数量提升35%以上,同时实时性更好、计算消耗降低40%;基于鲁棒环形山提取的光学导航算法实时性更好。

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

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

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

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

Canny算子中Otsu阈值分割法的运用

Canny算子只要能适当地选择其参数就能提取物体清晰的轮廓。利用类间方差最大化阈值分割算法(Otsu)能够计算出对Canny算子性能具有决定意义的高门限值,然后将这门限值运用于Canny算子来检测物体边缘。从实验结果看,Otsu算法应用于Canny算子中门限选择,改善了Canny算子的边缘提取效果,取得了预计的成果。

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

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

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

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

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

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

新的Otsu阈值改进方法的红外小目标检测

针对红外小目标区域灰度对比度很差的现象,以及红外小目标实时性检测的要求,在对Otsu阈值方法进行研究的基础上,结合红外小目标图像的自身特点,提出了一种新的Otsu阈值改进的红外小目标检测方法。该方法不仅继承了Otsu阈值方法比较简单,计算速度较快的优点,更重要的是很好地解决了照度不均匀的图像分割时候多个红外小目标粘连的问题,使红外小目标能够被清晰地检测出来。实验结果表明,新的Otsu阈值改进方法检测出红外小目标的准确率比Otsu阈值检测方法提高了20%。

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

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