局部信息熵的快速混合测地区域活动轮廓模型

针对变分水平集算法在图像分割过程中计算量较大且收敛速度慢的现象,在前人研究的基础上提出了一种新的局部信息熵的混合测地区域活动轮廓模型。该模型构造一个新的能量泛函,在泛函中引入柔化核函数作为窗口核函数,构造一个新的符号压力函数来代替测地线边缘检测函数,并以局部信息熵作为图像拟合能量项的权重,通过非凸正则化项来约束水平集函数。由此得到的算法不仅能加快轮廓曲线的收敛速度,而且可以处理那些由于光照或其他外界因素的变化产生的灰度不均匀或者模糊的图像,提高分割的精确性。将算法在合成图像和真实图像上做仿真实验,实验结果表明,该算法具有较快的收敛速度,分割也较准确,同时对轮廓曲线的初始位置不敏感,具有很好的鲁棒性。     

结合局部熵能量泛函与非凸正则项的图像分割

为了克服灰度不均匀对图像分割的影响，结合CV模型的全局能量项和LBF模型的局部能量项，引入图像局部熵信息和非凸正则项，构造新的能量泛函，提出了结合局部熵的局部能量泛函与非凸正则项的图像分割算法。该算法首先采用CV模型中的全局能量泛函得到图像的大致演化轮廓；通过构建具有局部熵信息的局部能量泛函，实现对图像的精确分割。然后，利用非凸正则项作为图像演化过程中零水平集逼近目标的又一驱动力驱动曲线演化和边缘保护。该算法利用变分水平集方法将这一新构建的能量泛函进行最小化，通过迭代更新水平集函数，完成曲线演化。最后，对比实验表明，所提出的算法可以高效、准确地分割灰度不均匀图像。     

一种新的灰度非均匀图像分割模型

基于局部区域的主动轮廓分割模型在针对灰度非均匀图像进行分割时,容易受到初始轮廓曲线位置的影响,且基于水平集模型的数值实现速度较慢。为此,提出一种新的图像分割模型。该模型采用局部符号差能量项作为曲线演化的驱动力,为减少模型对初始轮廓曲线位置的依赖,采用全局凸分割策略,得到一个离散化的凸分割模型,该模型包含Mumford-Shah分割模型中的二次光滑项,使分割后的区域更加平滑,使用split Bregman迭代算法进行数值实现。实验结果表明,与局部二值拟合模型、局部符号差能量模型相比,该模型能对灰度非均匀图像进行较准确的分割,具有较快的运算速度和较好的鲁棒性。     

一种具有去噪能力的全局最小值分割模型

几何主动轮廓模型的能量泛函是非凸性的,导致图像分割结果依赖于曲线的初始化条件,对噪声敏感。针对该问题,提出一种全局最小值分割模型,对能量泛函进行凸性非约束改进,利用基于总变分对偶公式的快速数值化算法实现图像的分割。对合成图像和医学图像的分割结果表明,利用该模型可以准确提取出对象的边界,分割速度快,对噪声具有较好的鲁棒性。     

基于核函数的活动轮廓模型

为了改善活动轮廓模型的分割精度和效率,提出一种基于核函数的活动轮廓模型.该模型采用鲁棒的非欧氏距离度量构造能量泛函,提高了模型的分割精度;使用指数类型的核特征函数来提升收敛速度;最后在模型中还加入了水平集正则项,以避免水平集的重新初始化.实验结果表明,文中模型在分割精度和分割效率上都要强于Chan-Vese模型.     

Cauchy-Schwarz散度在图像分割中的应用

基于Cauchy-Schwarz散度,提出了一种新的主动轮廓线图像分割模型。该模型能量泛函有两部分组成：几何正则项和数据拟合项。其中,数据拟合项通过图像灰度的概率密度函数之间的Cauchy-Schwarz散度来加以构造,并且对概率密度函数进行了非参数估计。为了快速获得新模型的全局最优解,采用了模型的凸化及Split-Bregman快速迭代技术。通过一些图像的分割实验,验证了该模型可取得令人满意的分割效果且具有较快的收敛速度。     

结合FCM和RSF模型的医学图像分割方法

针对现有活动轮廓模型初始化敏感的缺点,提出一种新的基于区域的活动轮廓模型。该模型采用模糊c均值聚类(FCM)算法对图像进行预分割,将预分割结果二值化为种子标记矩阵,作为下一步水平集演化的初始轮廓,解决了初始化敏感问题;引用RSF(Region-Scalable Fitting)模型的局部区域项作为能量项,提高了分割灰度分布不均匀图像能力;使用高斯滤波方法正则化水平集函数,避免了重新初始化过程,提高了分割效率。实验结果表明:该模型避免了初始化,具有分割结果精确、分割效率高的特点。     

基于局部增强与区域拟合的活动轮廓模型

针对活动轮廓模型在分割弱边缘图像及严重的灰度不均匀图像方面存在轮廓曲线不能很好地演化到目标边界等问题,提出了一种基于局部增强与区域拟合的活动轮廓模型。首先,利用局部区域增强方法将原始图像转换为新图像,以增强图像的对比度。其次,利用统计信息计算图像的区域拟合能量。然后,加入正则项以避免演化轮廓重新初始化,提高图像分割效率。最后,通过灰度不均匀的合成图像和真实图像的实验,验证了该算法的有效性。     

一种区域自适应主动轮廓模型的图像分割方法

为了有效地分割灰度不均匀图像,提出了一种区域自适应主动轮廓模型,在该模型中,定义了一个包含全局能量项和局部能量项的能量泛函。在算法的初期,全局能量项占主导地位,它具有收敛速度快、对初始轮廓不敏感的优点。在算法的后期,局部能量项占主导地位,它具有定位精度高的优点。理论分析和实验结果表明,该模型具有收敛速度快、分割精度高、对初始轮廓不敏感等优点。     

基于优化活动轮廓模型的SAR影像海陆分割方法研究*

SAR（合成孔径雷达）影像具有很强的乘性斑噪,给图像分割带来了困难。本文利用Gamma分布拟合SAR影像,并将其用于构造基于区域信息的能量泛函,提出了一种基于活动轮廓模型的SAR影像海陆自动分割方法。该方法在能量泛函中同时融合了边缘信息和区域信息,既有利于边界精确定位又有利于降低乘性斑噪的影响,利用活动轮廓演化模型,通过变分水平集方法推动活动轮廓曲线向海岸线演化,在最小化特定的能量泛函的约束下,使活动轮廓与海岸线重合,达到影像分割的目的。同时针对该模型提出了优化方法提高其计算效率,使本文提出的分割算法更加实用。     

Active contour model for simultaneous MR image segmentation and denoising

In this paper, a new region-based active contour model is proposed for magnetic resonance image segmentation and denoising based on the global minimization framework and level set evolution. A new region fitting energy based on Nadaraya–Watson estimator and local image information is defined to enforce the curve evolution. By this improved region fitting term, the images with noise and intensity un-uniformity can be segmented and denoised. Inspired by the Perona–Malik diffusion equation, an edge-preserving regularization term is defined through the duality formulation to penalize the length of region boundaries. By this new regularization term, the edge information is utilized to improve the contour?s ability of capturing the edge and remaining smooth during the evolution. The energy functional of the proposed model is minimized by an efficient dual algorithm avoiding the inefficiency of the gradient descent method. Experiments on medical images demonstrate the proposed model provides a hybrid way to perform image segmentation and image denoising simultaneously.     

Multiple piecewise constant with geodesic active contours (MPC-GAC) framework for interactive image segmentation using graph cut optimization

This paper proposes an improved variational model, multiple piecewise constant with geodesic active contour (MPC-GAC) model, which generalizes the region-based active contour model by Chan and Vese, 2001 [11] and merges the edge-based active contour by Caselles et al., 1997 [7] to inherit the advantages of region-based and edge-based image segmentation models. We show that the new MPC-GAC energy functional can be iteratively minimized by graph cut algorithms with high computational efficiency compared with the level set framework. This iterative algorithm alternates between the piecewise constant functional learning and the foreground and background updating so that the energy value gradually decreases to the minimum of the energy functional. The k-means method is used to compute the piecewise constant values of the foreground and background of image. We use a graph cut method to detect and update the foreground and background. Numerical experiments show that the proposed interactive segmentation method based on the MPC-GAC model by graph cut optimization can effectively segment images with inhomogeneous objects and background.     

An active contour model driven by anisotropic region fitting energy for image segmentation

A novel region active contour model (ACM) for image segmentation is proposed in this paper. In order to perform an accurate segmentation of images with non-homogeneous intensity, the original region fitting energy in the general region-based ACMs is improved by an anisotropic region fitting energy to evolve the contour. Using the local image information described by the structure tensor, this new region fitting energy is defined in terms of two anisotropic fitting functions that approximate the image intensity along the principal directions of variation of the intensity. Therefore, the anisotropic fitting functions extract intensity information more precisely, which enable our model to cope with the boundaries with low-contrast and complicated structures. It is incorporated into a variational formula with a total variation (TV) regularization term with respect to level set function, from which the segmentation process is performed by minimizing this variational energy functional. Experiments on the vessel and brain magnetic resonance images demonstrate the advantages of the proposed method over Chan–Vese (CV) active contours and local binary active contours (LBF) in terms of both efficiency and accuracy.     

An improved region-based model with local statistical features for image segmentation

In this paper, we propose a new region-based active contour model (ACM) for image segmentation. In particular, this model utilizes an improved region fitting term to partition the regions of interests in images depending on the local statistics regarding the intensity and the magnitude of gradient in the neighborhood of a contour. By this improved region fitting term, images with noise, intensity non-uniformity, and low-contrast boundaries can be well segmented. Integrated with the duality theory and the anisotropic diffusion process based on structure tensor, a new regularization term is defined through the duality formulation to penalize the length of active contour. By this new regularization term, the structural information of images is utilized to improve the ability of capturing the geometric features such as corners and cusps. From a numerical point of view, we minimize the energy function of our model by an efficient dual algorithm, which avoids the instability and the non-differentiability of traditional numerical solutions, e.g. the gradient descent method. Experiments on medical and natural images demonstrate the advantages of the proposed model over other segmentation models in terms of both efficiency and accuracy.     

局部熵驱动的模糊区域竞争图像分割

针对现有图像分割模型对光照敏感,提出一种新的基于区域的主动轮廓线模型。该模型能量泛函包含一个惩罚区域弧长的几何正则项和一个区域数据拟合项,特别的是数据拟合项采用局部熵来区分不同的区域。首先,根据图像像素空间排列之间的相关性,采用一个滑动窗函数提取图像局部熵特征,将图像从灰度空间转化到相应局部熵特征空间;然后,在局部熵空间计算最大后验分割概率得出两相区域竞争模型,为了能够快速求解该模型,采用隶属度函数替换特征函数得到了凸的模糊区域竞争模型。最后,采用快速的Chambolle对偶方法得到全局最小解。实验结果表明,该算法可以得到令人满意的分割效果且收敛速度快和对光照稳定。     

A scalable region-based level set method using adaptive bilateral filter for noisy image segmentation

Image segmentation plays an important role in the computer vision . However, it is extremely challenging due to low resolution, high noise and blurry boundaries. Recently, region-based models have been widely used to segment such images. The existing models often utilized Gaussian filtering to filter images, which caused the loss of edge gradient information. Accordingly, in this paper, a novel local region model based on adaptive bilateral filter is presented for segmenting noisy images. Specifically, we firstly construct a range-based adaptive bilateral filter, in which an image can well be preserved edge structures as well as resisted noise. Secondly, we present a data-driven energy model, which utilizes local information of regions centered at each pixel of image to approximate intensities inside and outside of the circular contour. The estimation approach has improved the accuracy of noisy image segmentation. Thirdly, under the premise of keeping the image original shape, a regularization function is used to accelerate the convergence speed and smoothen the segmentation contour. Experimental results of both synthetic and real images demonstrate that the proposed model is more efficient and robust to noise than the state-of-art region-based models.

     

区域信息和水平集方法的图像分割

随着图像处理技术不断发展,图像分割技术也在不断的走向成熟,但是目前比较成熟的分割方法都存在一定的局限性,传统的分割方法一般都难以实现全局分割,而且对目标边缘比较模糊的物体难以实现有效的精确的分割;基于区域信息和水平集方法的图像分割算法弥补了这些缺陷,该算法是在传统的动态轮廓GAC模型和C_V模型的基础上进行改善;通过实验分析,首先,该算法极大提高了图像分割的精确性,使得轮廓线能够在要分割目标的边缘附近停止演化,即使目标的边缘是模糊不清的图像,该算法也能实现精确地分割;其次,该算法还克服了传统动态轮廓分割算     

结合全局与局部信息活动轮廓的非同质图像分割

目的 通过对现有基于区域的活动轮廓模型能量泛函的Euler-Lagrange方程进行变形,建立其与K-means方法的等价关系,提出一种新的基于K-means活动轮廓模型,该模型能有效分割灰度非同质图像。方法 结合图像全局和局部信息,根据交互熵的特性,提出新的局部自适应权重,它根据像素点所在邻域的局部统计信息自适应地确定各个像素点的分割阈值,排除灰度非同质分割目标的影响。结果 采用Jaccard相似系数-JS(Jaccard similarity)和Dice相似系数-DSC(Dice similarity coefficient)两个指标对自然以及合成图像的分割结果进行定量分析,与传统及最新经典的活动轮廓模型相比,新模型JS和DSC的值最接近1,且迭代次数不多于50次。提出的模型具有较高的计算效率和准确率。结论 通过大量实验发现,新模型结合图像全局和局部信息,利用交互熵特性得到自适应权重,对初始曲线位置具有稳定性,且对灰度非同质图像具有较好地分割效果。本文算法主要适用于分割含有噪声及灰度非同质的医学图像,而且分割结果对初始轮廓具有鲁棒性。     

Moment-based alignment for shape prior with variational B-spline level set

This paper presents a new shape prior-based implicit active contour model for image segmentation. The paper proposes an energy functional including a data term and a shape prior term. The data term, inspired from the region-based active contour approach, evolves the contour based on the region information of the image to segment. The shape prior term, defined as the distance between the evolving shape and a reference shape, constraints the evolution of the contour with respect to the reference shape. Especially, in this paper, we present shapes via geometric moments, and utilize the shape normalization procedure, which takes into account the affine transformation, to align the evolving shape with the reference one. By this way, we could directly calculate the shape transformation, instead of solving a set of coupled partial differential equations as in the gradient descent approach. In addition, we represent the level-set function in the proposed energy functional as a linear combination of continuous basic functions expressed on a B-spline basic. This allows a fast convergence to the segmentation solution. Experiment results on synthetic, real, and medical images show that the proposed model is able to extract object boundaries even in the presence of clutter and occlusion.