结合局部能量与改进的符号距离正则项的图像目标分割算法

针对传统C-V模型对颜色不均匀图像分割失败并且对初始轮廓和位置敏感问题,以及现有符号距离正则项存在周期性振荡和局部极值问题。该文提出结合局部能量信息和改进的符号距离正则项的图像目标分割算法。首先,将全局图像信息扩展到HSV空间,并使用局部能量项信息分析每个像素及其领域内的统计特性,从而在较少的迭代次数内有效分割颜色分布不均匀图像。其次,改进现有符号距离正则项,改进后的符号距离正则项在避免水平集函数的重新初始化的同时,提高了计算效率,保证了水平集函数演化过程的稳定性。然后,定义阈值判断法的水平集函数演化的终止准则,使曲线准确演化到目标轮廓。该算法与同类模型的对比实验表明该模型具有较高的分割精度和对初始轮廓的鲁棒性。     

基于Wasserstein距离的局部能量分割模型

 提出了一种基于Wasserstein距离和图像局部区域直方图信息的非参数活动轮廓分割模型.用该距离对图像中不同区域的直方图进行比较,提高了相似性衡量的准确性;引入高斯内核函数来获取图像局部区域直方图信息,并将信息嵌入模型指导轮廓演化,以克服由于亮度不均造成的图像分割困难;通过水平集规范项提高计算精度并避免水平集演化的重新初始化.实验结果表明,本模型能够对亮度不均的无序特征图像进行有效准确的分割.     

结合图像局部信息和Hausdorff距离的活动轮廓模型医学图像分割算法

本文提出了一种新的基于距离局部信息的活动轮廓摸型。该模型的能量函数将区域可扩展能量项(region scalable fitting, RSF)和Hausdorff距离项结合,其中RSF项在目标边缘附近起主导作用,用来吸引水平集函数曲线到达目标边界;而Hausdorff距离由于包含了局部区域的相似信息,可以提高分割方法的稳定性。在保证分割精度的情况下,相对于区域可伸缩拟合及局部巴氏距离的活动轮廓模型RSFB方法,本文方法具有更快的收敛速度和更好的参数选择鲁棒性,对于解决图像分割中的边界模糊和噪声问题效果显著。实验结果显示本文提出的方法在超声图像和不均匀图像的分割中都有非常好的效果,且计算量较小。      

基于C-V模型的红外图像自动分割方法研究

为解决红外图像分割中背景噪声及边界轮廓的影响,引入了基于曲线演化理论、水平集方法和M-S分割函数的C-V模型。通过将图像表达为分段常量函数来建立适当的能量函数模型,引入水平集的表示方法,在整个图像域中依据最小化分割寻找全局极小值,可令活动轮廓最终到达目标边缘。由MATLAB实现的仿真结果表明采用C-V模型对红外图像进行自动分割不受边界轮廓线连续性限制,对初始轮廓线位置不敏感,对图像噪声具有很强的鲁棒性,对均匀灰度目标分割效果良好。     

一种鲁棒的非均匀灰度图像分割算法

针对非均匀灰度图像分割困难及分割效率低下的问题,该文提出了一种基于活动轮廓模型的高效图像分割算法。不同于传统水平集方法中仅用单一信息定义的能量泛函,该算法结合图像的边缘信息和区域统计信息定义了一个新的能量泛函。边缘信息的利用便于演化轮廓线快速精确地定位至物体边缘;区域统计信息由局部统计信息和全局统计信息构成,一方面,局部统计信息的利用能够有效处理图像的灰度分布不均匀现象,另一方面,全局统计信息的利用避免了轮廓线陷入局部极小值。最后,在轮廓线演化过程中,通过高斯卷积核实现快速规则化,避免了传统模型计算代价高昂的重新初始化或规则化。合成图像和真实图像的实验结果表明,该文算法不仅能够快速有效分割灰度分布不均匀的弱边缘物体,而且对于多灰阶复杂结构物体也能够精确分割;同时,该算法对噪声和初始轮廓线具有较好的鲁棒性。     

一种基于改进Chan-Vese模型的红外图像分割方法

为了解决基于Chan-Vese(CV)模型的传统水平集方法难以分割灰度不均匀红外图像的问题,本文提出一种基于改进CV模型的水平集分割方法。通过加入可处理局部区域信息的局部项,使得改进的CV模型能够有效避免不均匀背景对水平集演化过程的干扰。此外,通过加入符号距离能量惩罚项,使得该模型无需重新初始化过程,从而提高了水平集函数的演化效率。实验结果表明,本文方法对于红外图像的分割具有较高的精度。     

一种新的SAR图像局部拟合活动轮廓模型

本文基于I-divergence-TV(IDT)去噪模型和变分水平集方法提出一个新的局部拟合活动轮廓模型。该模型能有效解决SAR图像的分割问题,并且不需要周期性地更新水平集函数。通过对合成图像和实测Envisat SAR图像的分割实验,提出的模型与局部拟合RSF模型相比具有更准确的边缘定位能力和噪声抑制能力。     

基于改进C-V模型的图像分割算法

提出一种新的模型——Chan-Vese模型,该模型是基于曲线演化、水平集方法、局部的统计信息,新模型包括两个方面:局部核心函数和惩罚项.引入局部统计信息后的新模型可以对非同质图像进行有效的分割.另外,核心函数中加入惩罚项,可以有效避免水平集函数初始化,缩短模型演化时间.通过实验的仿真结果发现,新模型在对非同质图像进行分割时得到了良好的结果.     

快速自适应非局部空间加权与隶属度连接的模糊C-均值噪声图像分割算法

针对传统模糊C-均值聚类(FCM)算法难以对噪声图像进行分割的问题,该文提出一种快速自适应非局部空间加权与隶属度连接的模糊FCM抗噪图像分割算法。首先,利用一种非局部空间信息快速计算方法,将以图像所有像素为循环的原始非局部信息计算方法,改为以搜索窗口尺寸为循环,利用空间位移图像与递归高斯滤波的计算方法,克服非局部空间信息计算复杂的问题;其次,计算原始图像与非局部信息项的差值的平方,将其作为非局部信息项的自适应权重,并将差值的平方作倒数变换,作为原始图像的自适应权重;最后,将每个聚类簇中所有像素隶属度之和的对数平方加入目标函数的分母,形成隶属度连接,减少目标函数迭代次数。含噪人工与自然图像分割实验表明,该算法在分割准确度、平均交并比、归一化互信息、运行时间与迭代次数等性能方面优于其他几种FCM算法。     

快速自适应非局部空间加权与隶属度连接的模糊C-均值噪声图像分割算法

针对传统模糊C-均值聚类(FCM)算法难以对噪声图像进行分割的问题,该文提出一种快速自适应非局部空间加权与隶属度连接的模糊FCM抗噪图像分割算法.首先,利用一种非局部空间信息快速计算方法,将以图像所有像素为循环的原始非局部信息计算方法,改为以搜索窗口尺寸为循环,利用空间位移图像与递归高斯滤波的计算方法,克服非局部空间信息计算复杂的问题;其次,计算原始图像与非局部信息项的差值的平方,将其作为非局部信息项的自适应权重,并将差值的平方作倒数变换,作为原始图像的自适应权重;最后,将每个聚类簇中所有像素隶属度之和的对数平方加入目标函数的分母,形成隶属度连接,减少目标函数迭代次数.含噪人工与自然图像分割实验表明,该算法在分割准确度、平均交并比、归一化互信息、运行时间与迭代次数等性能方面优于其他几种FCM算法.     

A robust hybrid active contour model based on pre-fitting bias field correction for fast image segmentation

An array of existing active contour models is prone to suffering from the deficiencies of poor anti-noise ability, initialization sensitivity, and slow convergence. In order to handle these problems, a robust hybrid active contour method based on bias correction is proposed in this research paper The energy functional is formulated through incorporating the adaptive edge indicator function and level set formulation driven by bias field correction. The adaptive edge indicator function, which is formulated based on image gradient information, is utilized to detect object boundaries and accelerate the segmentation in the homogeneous region. The level set formulation is constructed based on an improved criterion function, in which bias field information is considered. Specifically, the bias field distribution is approximated through the local mean gray value algorithm as a prior. Moreover, a new regularized function is proposed so as to maintain the stability of curve evolution. The segmentation process is implemented by the optimized energy function and the novel regularized term. Compared to previous active contour models, the modified active contour method can yield more precise, stable, and efficient segmentation results on some challenging images.     

Minimization of region-scalable fitting energy for image segmentation

Intensity inhomogeneities often occur in real-world images and may cause considerable difficulties in image segmentation. In order to overcome the difficulties caused by intensity inhomogeneities, we propose a region-based active contour model that draws upon intensity information in local regions at a controllable scale. A data fitting energy is defined in terms of a contour and two fitting functions that locally approximate the image intensities on the two sides of the contour. This energy is then incorporated into a variational level set formulation with a level set regularization term, from which a curve evolution equation is derived for energy minimization. Due to a kernel function in the data fitting term, intensity information in local regions is extracted to guide the motion of the contour, which thereby enables our model to cope with intensity inhomogeneity. In addition, the regularity of the level set function is intrinsically preserved by the level set regularization term to ensure accurate computation and avoids expensive reinitialization of the evolving level set function. Experimental results for synthetic and real images show desirable performances of our method.     

Image segmentation using fuzzy energy-based active contour with shape prior

This paper presents a fuzzy energy-based active contour model with shape prior for image segmentation. The paper proposes a fuzzy energy functional including a data term and a shape prior term. The data term, inspired from the region-based active contour approach proposed by Chan and Vese, evolves the contour relied on image information. The shape term inspired from Chan and Zhu’s work, defined as the distance between the evolving shape and a reference one, constrains the evolving contour with respect to the reference shape. To align the shapes, we exploit the shape normalization procedure which takes into account the affine transformation. In addition, to minimize the energy functional, we utilize a direct method to calculate the energy alterations. The proposed model therefore can deal with images with background clutter and object occlusion, improves the computational speed, and avoids difficulties associated with time step selection issue in gradient descent-based approaches.     

Automatic segmentation of coronary arteries in CT imaging in the presence of kissing vessel artifacts

In this paper, we present a novel two-step algorithm for segmentation of coronary arteries in computed tomography images based on the framework of active contours. In the proposed method, both global and local intensity information is utilized in the energy calculation. The global term is defined as a normalized cumulative distribution function, which contributes to the overall active contour energy in an adaptive fashion based on image histograms, to deform the active contour away from local stationary points. Possible outliers, such as kissing vessel artifacts, are removed in the postprocessing stage by a slice-by-slice correction scheme based on multiregion competition, where both arteries and kissing vessels are identified and tracked through the slices. The efficiency and the accuracy of the proposed technique are demonstrated on both synthetic and real datasets. The results on clinical datasets show that the method is able to extract the major branches of arteries with an average distance of 0.73 voxels to the manually delineated ground truth data. In the presence of kissing vessel artifacts, the outer surface of the entire coronary tree, extracted by the proposed algorithm, is smooth and contains fewer erroneous regions, originating in kissing vessel artifacts, as compared to the initial segmentation.     

A fuzzy energy-based active contour model with adaptive contrast constraint for local segmentation

Image segmentation is to divide an image into different parts or extract some interested objects. Active contour model and fuzzy clustering are two widely used segmentation methods, which have been integrated into an effective model in recent years. Local segmentation is often needful in medical image processing. In view of local segmentation on inhomogeneous images, a new average fuzzy energy-based active contour model is proposed in this paper, in which the total fuzzy energy integrates the approximate weighted average and arithmetic average variances of the image. And an adaptive contrast constraint condition is introduced to prevent the curve from falling into local minimum, which further improves the robustness of the segmentation model to initial contour. Experimental results on synthetic and medical images demonstrate that the proposed model has considerable improvements in terms of segmentation accuracy and robustness compared to several existing local segmentation models.     

Image segmentation based on multi-region multi-scale local binary fitting and Kullback–Leibler divergence

The inhomogeneity of intensity and the noise of image are the two major obstacles to accurate image segmentation by region-based level set models. To provide a more general solution to these challenges and address the difficulty of image segmentation methods to handle an arbitrary number of regions, we propose a region-based multi-phase level set method, which is based on the multi-scale local binary fitting (MLBF) and the Kullback–Leibler (KL) divergence, called KL–MMLBF. We first apply the multi-scale theory and multi-phase level set framework to the local binary fitting model to build the multi-region multi-scale local binary fitting (MMLBF). Then the energy term measured by KL divergence between regions to be segmented is incorporated into the energy function of MMLBF. KL–MMLBF utilizes the between-cluster distance and the adaptive kernel function selection strategy to formulate the energy function. Being more robust to the initial location of the contour than the classical segmentation models, KL–MMLBF can deal with blurry boundaries and noise problems. The results of experiments on synthetic and medical images have shown that KL–MMLBF can improve the effectiveness of segmentation while ensuring the accuracy by accelerating this minimization of this energy function and the model has achieved better segmentation results in terms of both accuracy and efficiency to analyze the multi-region image.     

基于边缘和区域信息相结合的变分 水平集图像分割方法

 针对GAC模型和C-V模型分别存在对弱边缘和灰度渐进图像分割效果不理想以及演化效率低等问题,提出了一种基于边缘和区域信息相结合的变分水平集图像分割方法.结合了图像边缘梯度信息和区域全局信息的能量函数作为模型的外部能量项,引入内部变形能量约束水平集函数来逼近符号距离函数,省去了重新初始化水平集函数的过程,并融入了物体形状先验知识的附加约束信息,提高了分割精度.实验结果表明,论文所用方法对分割噪声弱边缘图像和灰度渐进图像具有一定的有效性和可行性.