基于绝对值距离的图像阈值化分割新算法

传统Otsu阈值法对图像分割缺乏一定鲁棒性的不足,将Otsu阈值法的平方欧氏距离用绝对值距离代替得到一种新的图像阈值化分割准则,提出了基于绝对值距离的图像阈值分割新算法,最后给出其参数估计方法.实验结果表明,分割新算方法是有效的,能够获得比传统Otsu方法更好的分割结果.     

基于核空间的Otsu阈值法

为了改善传统Otsu分割方法的分割性能,提出了一种基于核空问函数变换的崭新Otsu闲值化分割方法.该方法首先利用再生核空间的核函数将低维空间的样本映射到高维空间,其样本之间的差异性度量采用基于棱函数的距离测度;其次得到了一种基于核空间距离的最小二乘法并采用迭代法来估计样本均值;曩后得到了基于核函数距离和一维直方图相结合的最小偏差图像阈值化分割方法,将其简称为核空阍Otsu闲值法.实验结果表明,基于核空间的Otsu法相对传统Otsu法有更好的分割性能.     

灰度图像二维最小类方差递推及差分演化的快速分割

为克服Otsu法阈值偏离及一维最小类方差法在含噪图像分割中性能不佳的问题,基于图像灰度级二维直方图,提出一种二维最小类方差快速阈值化方法.通过递推方式计算得到图像前景及背景在不同阈值向量上的灰度级类概率及类均值,在此基础上,应用差分演化算法搜寻使图像类方差最小的阈值向量,并用该阈值向量对图像实施分割.在合成及真实图像上的实验结果表明,采用文中方法可获得良好的分割性能,有效地克服了Otsu法及一维最小类方差法的不足;采用递推及差分演化算法使计算时间大幅降低,可满足工程应用需求.     

数字图像处理等；基于二维Otsu和模糊聚类的图像分割算法*

针对传统二维Otsu算法计算复杂度高的问题,提出一种改进的Otsu图像分割算法。该算法通过求两个一维Otsu法的阈值来代替传统二维Otsu法的阈值,使得计算复杂度得到了降低;同时为了改进分割效果,结合使用了模糊C-均值聚类算法。实验结果表明,改进的算法充分发挥了两者的优势,不仅在计算速度上优于原二维Otsu算法,且分割效果较好。     

基于分解的三维Otsu图像分割快速算法

摘要：针对三维Otsu图像分割算法计算复杂度高,运算量大的问题,本文提出一种基于分解的三维Otsu图像分割快速算法。该算法,首先将三维Otsu分解为三个一维Otsu;然后,在分析一维Otsu的基础上,结合类间距离和类内距离,提出一种新的阈值识别函数设计算法,并给出了快速实现方法。实验结果表明,该算法不仅可以取得较好的分割效果,而且计算量较小,比三维Otsu阈值分割递推算法快1400倍左右。     

二维Otsu阈值分割算法的改进

自动图像阈值分割技术已经被广泛的应用在图像处理和计算机视觉领域中的目标检测,跟踪和识别上。其中Otsu阈值分割算法是一种被广泛使用的分割技术,对于那些直方图呈双峰分布的图像可以得到优秀的分割效果。然而如果直方图是单峰或是有异常数据出现时,传统的Otsu阈值分割算法则会发生错误。为改善传统Otsu法在处理图像时的计算受噪声干扰严重、实时性差、复杂度高等缺点,本文提出了一种改进的基于中值的Otsu阈值分割算法。最后进行的多次测试和实验说明这种改进的方法与传统的Otsu阈值分割算法相比较会得到更加满意的结果。     

基于0-1规划的快速图像阈值分割算法

阈值方法是一种重要的图像分割方法,在图像分割中得到了广泛应用。Otsu算法虽然是图像分割阈值法中较好的方法之一,但是由于传统的Otsu算法通常用穷举法求解,使得处理多阈值问题时运算速度太慢,难以满足应用需求。为了快速有效地确定阈值,提出了一种改进的Otsu算法。将Otsu算法转化为一个非线性0-1数学规划问题,再利用遗传算法求解得到最优阈值。通过对测试图像的分割实验,表明该算法与传统的Ot-su算法相比运算速度有非常显著的提高,能够满足一般的应用需求。     

基于标记的分水岭图像分割算法研究

本文针对分水岭算法的过分割问题,设计了一种结合形态学运算的基于标记的分水岭算法.算法首先对梯度图像进行形态学开重建运算和形态学闭重建运算滤波平滑;然后去掉图像中像素个数小于20的局部极小值区域,提取前景标记;用Otsu法求阈值,对二值图像进行距离变换,分水岭分割,得到的分水线图像作为背景标记;最后用强制最小技术修改梯度图像,进行分水岭分割.实验结果表明,此方法能有效抑制过分割,得到与人工标注的分割目标更接近的结果.     

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

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

改进的三维Otsu图像分割快速算法

针对三维Otsu图像分割算法运算量大和图像细节分割不够准确的问题,提出一种改进的三维Otsu图像分割算法。该算法基于灰度-邻域平均灰度-梯度的新的三维特征模型,构建三维直方图;将三维Otsu分解为三个一维Otsu;在同时考虑类间距离和类内距离的基础上,提出一种新的最大散度差准则。实验结果表明,该算法不仅可以取得较好的分割效果,而且计算量较小,比三维Otsu阈值分割递推算法快900倍左右。     

Automatic multi-thresholds selection for image segmentation based on evolutionary approach

Automatic thresholding has been widely used in machine vision for automatic image segmentation. Otsu’s method selects an optimum threshold by maximizing the between-class variance in a grayscale image. However, the method becomes time-consuming when extended to multi-level threshold problems, because excessive iterations are required in order to compute the cumulative probability and the mean of class. In this paper, we focus on the issue of automatic selection for multi-level thresholding, and we greatly improve the efficiency of Otsu’s method for image segmentation based on evolutionary approaches. We have investigated and evaluated the performance of the Otsu and Valleyemphasis thresholding methods. Based on our evaluation results, we have developed many different algorithms for automatic threshold selection based on the evolutionary method using the Modified Adaptive Genetic Algorithm and the Hill Climbing Algorithm. The experimental results show that the evolutionary approach achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.     

融合非局部空间灰度信息的三维Otsu法

为了提高最大类间方差阈值分割法(Otsu)对于图像噪声的鲁棒性,提出融合非局部空间灰度信息的三维Otsu法。该方法利用图像像素的灰度信息、邻域中值灰度信息和非局部空间灰度信息进行直方图统计,构建新颖的三维直方图,采用最大类间方差作为阈值选取准则。实验结果表明新方法对于噪声的鲁棒性要优于原始三维Otsu法,能够获得更加令人满意的分割结果。     

核空间散度阈值法

提出了一种核空间散度阈值分割方法。首先定义了一种参数型Bregman散度;其次提出了参数型Bregman散度阈值法,并将现有交叉熵阈值法和Otsu阈值法统一起来;再次基于参数型Bregman散度构造了核空间中一种新的不对称核函数,将图像灰度级从欧氏空间变换到再生核空间,获得了一种核空间的散度阈值分割法;最后研究了该分割法中核函数参数选取方法。实验结果表明,基于核空间的散度分割法具有一定的普适性,并能改善现有交叉熵阈值法和Otsu阈值法的分割性能,同时也可将这两种经典阈值分割法看做核空间散度阈值法的特殊情形。     

自适应最小误差阈值分割算法

对二维最小误差法进行三维推广, 并结合三维直方图重建和降维思想提出了一种鲁 棒的最小误差阈值分割算法. 但该方法为全局算法, 仅适用于分割均匀光照图像. 为 提高其自适应性, 本文采用Water flow模型对非均匀光照图像进行背景估计, 以此获 得原始图像与背景图像的差值图像, 达到降低非均匀光照对图像分割造成干扰的目的. 为进 一步提高分割性能, 本文对差值图像采用γ 矫正进行增强, 然后采用鲁棒最小误差 法进行全局分割, 从而完成目标提取. 最后本文对均匀光照下以及非均匀光照下图像进行了 实验, 并与一维最小误差法、二维最小误差法、三维直方图重建和降维的Otsu阈值分割 算法、灰度波动变换自适应阈值方法以及一种改进的FCM方法在错误分割率和运行时间上进 行了对比. 实验结果表明, 相对于以上方法, 本算法的分割性能均有明显提升.     

基于特征距离的阈值法及其在眼科图象分割中的应用

医学图象的识别与分析能够为临床提供定量比的诊断依据,而图象分割是其中最关键的一步。为提高医学图象侵分割效果,提出了一种基于特征距离的阈值分割算法,并将其与颜色特征分类相结合,来对眼科裂隙灯生物显微镜图象上的角膜充血区进行分割,分割结果可用于角膜充血区的定量体分析,另外,该算法中的样本典型值是通过一种三维直方图分块算法来确定的,实验结果表明,该算法可以有效地分割出角膜充血,其分割效果优于欧氏距离阈值法,且分析数据的精度能够达到临床诊断的要求。     

A Local Contrast Fusion Based 3D Otsu Algorithm for Multilevel Image Segmentation

To overcome the shortcomings of 1D and 2D Otsu’s thresholding techniques, the 3D Otsu method has been developed. Among all Otsu’s methods, 3D Otsu technique provides the best threshold values for the multi-level thresholding processes. In this paper, to improve the quality of segmented images, a simple and effective multilevel thresholding method is introduced. The proposed approach focuses on preserving edge detail by computing the 3D Otsu along the fusion phenomena. The advantages of the presented scheme include higher quality outcomes, better preservation of tiny details and boundaries and reduced execution time with rising threshold levels. The fusion approach depends upon the differences between pixel intensity values within a small local space of an image; it aims to improve localized information after the thresholding process. The fusion of images based on local contrast can improve image segmentation performance by minimizing the loss of local contrast, loss of details and gray-level distributions. Results show that the proposed method yields more promising segmentation results when compared to conventional 1D Otsu, 2D Otsu and 3D Otsu methods, as evident from the objective and subjective evaluations.      

A multi-scale 3D Otsu thresholding algorithm for medical image segmentation

Thresholding technique is one of the most imperative practices to accomplish image segmentation. In this paper, a novel thresholding algorithm based on 3D Otsu and multi-scale image representation is proposed for medical image segmentation. Considering the high time complexity of 3D Otsu algorithm, an acceleration variant is invented using dimension decomposition rule. In order to reduce the effects of noises and weak edges, multi-scale image representation is brought into the segmentation algorithm. The whole segmentation algorithm is designed as an iteration procedure. In each iteration, the image is segmented by the efficient 3D Otsu, and then it is filtered by a fast local Laplacian filtering to get a smoothed image which will be input into the next iteration. Finally, the segmentation results are pooled to get a final segmentation using majority voting rules. The attractive features of the algorithm are that its segmentation results are stable, it is robust to noises and it holds for both bi-level and multi-level thresholding cases. Experiments on medical MR brain images are conducted to demonstrate the effectiveness of the proposed method. The experimental results indicate that the proposed algorithm is superior to the other multilevel thresholding algorithms consistently.     

基于鱼群算法的图像阈值分割*

本文提出了一种基于鱼群算法的二维阈值图像分割的新方法。传统的二维Otsu方法考虑了图像的灰度信息和像素间的空间邻域信息,是一种有效的图像分割方法。针对Ostu方法的计算量大、运行时间长的缺陷,采用鱼群算法来搜索最优二维阈值向量,通过鱼群追尾行为获得最优阈值。实验结果表明,所提出的方法不仅能得到理想的分割结果,而且分割速度快。     

一种改进遗传退火算法的图像分割方法

图像分割是图像处理和分析的基础,本文通过分析遗传算法（Genetic Algorithm, GA）在图像分割中的应用优劣,提出利用模拟退火思想的改进遗传退火（Genetic Simulated Annealing Algorithm, GASA）的图像阈值分割算法,算法整个运行过程由冷却温度进度表控制,使用改进的最大类间方差公式作为遗传算法的适应度函数,从而求得灰度图像的一个最佳阈值用于图像分割。实验结果表明,基于改进遗传退火算法的最大类间方差图像分割方法能较好提高算法的全局搜索能力,避免遗传算法陷入局部最优,并且能更快速、更稳定收敛到最佳的分割阈值,得到更好的图像分割效果。     

A new active contour remote sensing river image segmentation algorithm inspired from the cross entropy

The CV (Chan–Vese) model is a piecewise constant approximation of the Mumford and Shah model. It assumes that the original image can be segmented into two regions such that each region can be represented as constant grayscale value. In fact, the objective functional of the CV model actually finds a segmentation of the image such that the within-class variance is minimized. This is equivalent to the Otsu image thresholding algorithm which also aims to minimize the within-class variance. Similarly to the Otsu image thresholding algorithm, cross entropy is another widely used image thresholding algorithm and it finds a segmentation such that the cross entropy of the segmented image and the original image is minimized. Inspired from the cross entropy, a new active contour image segmentation algorithm is proposed. The region term in the new objective functional is the integral of the logarithm of the ratio between the grayscale of the original image and the mean value computed from the segmented image weighted by the grayscale of the original image. The new objective functional can be solved by the level set evolution method. A distance regularized term is added to the level set evolution equation so the level set need not be reinitialized periodically. A fast global minimization algorithm of the objective functional is also proposed which incorporates the edge term originated from the geodesic active contour model. Experimental results show that, the algorithm proposed can segment images more accurately than the CV model and the implementation speed of the fast global minimization algorithm is fast.