基于改进C-V水平集模型的SAR图像分割

本文研究了SAR图像分割的问题.利用一种加入图像边缘信息且无需重新初始化的改进水平集方法,获得了比传统C-V模型分割速度更快、准确度更高的分割结果.推广了C-V水平集模型分割灰度不均匀的SAR图像以及零水平集曲线的初始化等结果.     

基于改进的变分水平集C-V图像分割模型研究

为解决C-V模型中弱边缘或边缘模糊图像分割问题,提出了用边缘停止函数代替正则化Dirac函数的C-V图像分割模型.首先对正则化Heaviside函数和正则化Dirac函数中的参数进行了讨论,然后利用图像边缘信息将梯度算子引入正则化Driac函数中,对C-V模型进行改进,最后,用边缘停止函数代替C-V模型中的正则化Dirac函数.实验结果显示,提出的模型比C-V模型对图像的分割效果更好.     

一种新型的四相水平集图像分割方法

水平集方法在图像分割和计算机视觉领域有很广泛的应用,在传统的水平集方法中,水平集函数需要保持符号距离函数.现有的活动轮廓模型、GAC模型、M-S模型、C-V模型等在演化过程中均需要对水平集函数进行重新初始化,使其保持符号距离函数,然而这样会引起数值计算的错误,最终破坏演化的稳定性,另外这些模型只适用于灰度值较为均匀的图像,对灰度值不均匀的图像不能进行理想的分割·针对这些问题,结合C-V模型的思想,提出了一种带有正则项的四相水平集分割模型,其中正则项被定义为一个势函数,具有向前向后扩散的作用,使水平集函数在演化过程中保持为符号距离函数,避免了水平集函数重新初始化的过程.最后对该模型进行数值实现,实验表明了新模型的可行性和有效性.     

一种改进的Heaviside函数与Dirac函数的C-V图像分割研究

C-V模型中Heaviside函数和Dirac函数正则化逼近影响对目标图像的分割,根据Heaviside函数和Dirac函数的性质,提出了新的正则化Heaviside函数和Dirac函数.首先分析了C-V模型中正则化的Heaviside函数和Dirac函数在图像分割中所起的作用,在此基础上提出了新的正则化的Heaviside函数和Dirac函数,改进了C-V模型.实验结果表明,运用正则化的Heaviside函数和Dirac函数的图像分割效果较好.     

基于小波边缘刻画与LBF水平集变分模型的图像分割

本文研究了基于水平集的图像分割的问题.利用小波变换的方法,构造出图像边缘刻画函数,引入到LBF水平集分割变分模型中,获得了基于小波变换的WLBF模型,同时给出了WLBF模型的数值求解算法.针对不同情景下的典型灰度图像,给出了图像分割实例,推广了LBF模型及算法,实验结果证明WLBF模型及算法对图像分割的有效性.     

改进的水平集方法及其在图像分割中的应用

为了稳定水平集函数的演化过程,提出了一种改进的距离规则化水平集方法,新方法与传统的距离规则化方法相比,能更好地维持水平集函数的符号距离函数特性.为了检验新方法的性能,首先将其应用到基于边缘的主动轮廓模型中并用于图像分割,实验结果表明新方法能有效提高分割效率和精度.同时,还将新方法应用到一种改进的基于区域的主动轮廓模型中,实验结果不仅进一步验证了新方法的有效性,还表明新方法能改善初始位置的鲁棒性.     

基于元胞自动机模型的图像分割算法

针对图像处理中的图像分割任务,我们提出了一个基于模糊元胞自动机模型的图像分割算法.将元胞自动机原理中的演化规则换为模糊规则建立模糊元胞自动机模型,使图像中灰度水平介于目标和背景之间的像素得以更好地归类,从而得到较好的图像分割结果.     

低秩表示实现鲁棒的CT和MR图像分割

由于图像中的噪声和复杂性,传统的图像分割方法并不总是能够捕捉到所有细节,即可能会忽略相邻像素的属性或者将图像的不同部分合并在一起.为了充分利用可用信息,利用低秩表示(LRR)和鲁棒主成分分析(RPCA)模型的优点,提出了一种新的图像分割方法,通过模糊c均值(FCM)方法对低秩亲和矩阵进行聚类来获得分割结果.在整个方法中,低秩分量是图像的主要信息,是通过求解RPCA模型获得的,而亲和矩阵表示全局结构,则是通过求解LRR模型获得的.在实验部分,使用计算机断层扫描(CT)图像分割来评估本文方法,结果显示在准确性和鲁棒性方面都有了显著改进.与现有一些算法相比,本文算法对异常值更加鲁棒,并尽可能地保留了图像的细节信息.     

求解图像分割CV模型的BB算法

给出图像分割的一种新算法——BB算法.该方法的优点在于利用迭代过程中当前点和前一点的信息确定搜索步长,从而更有效地搜索最优解.为此,首先通过变分水平集方法将CV模型转化为最优化问题;其次,将BB算法引入该优化问题进行求解;然后,对BB算法进行收敛性分析,为该算法应用在CV模型中提供了理论依据;最后将该方法与已有的最速下降法、共轭梯度法的分割结果进行比较.结果表明,跟其他两种方法相比,BB算法在保证较好分割效果的前提下,提高了算法的速度和性能.     

直肠癌淋巴结转移的智能诊断研究

基于数字图像处理与机器学习等技术,对直肠癌淋巴结转移情况的诊断问题进行了研究,将肿瘤诊断分解成肿瘤区域提取的图像分割问题与肿瘤区域诊断的图像分类问题.首先,针对肿瘤区域提取的问题,根据直肠肿瘤CT图像的特点,提出了一种结合聚类和水平集方法的图像分割算法,其结果的Dice系数达到0.895 4±0.051 2,与专业医生人工提取的结果相比具有较高的相似度.然后,使用传统特征提取的方法,针对直肠癌淋巴结是否转移的问题,对肿瘤区域的CT图像进行了分类.实验结果表明,肿瘤的灰度特征与其淋巴结转移情况关联性最高,并且使用PCA降维得到的分类效果最优.最后,本文还使用深度学习方法对肿瘤图像进行了分类.本文使用AlexNet网络模型并采用迁移学习的方法进行训练,实验表明,该方法的效果优于传统方法,其F1-Score达到了0.771 9.     

Image segmentation by level set evolution with region consistency constraint

Image segmentation is a key and fundamental problem in image processing, computer graphics, and computer vision. Level set based method for image segmentation is used widely for its topology flexibility and proper mathematical formulation. However, poor performance of existing level set models on noisy images and weak boundary limit its application in image segmentation. In this paper, we present a region consistency constraint term to measure the regional consistency on both sides of the boundary, this term defines the boundary of the image within a range, and hence increases the stability of the level set model. The term can make existing level set models significantly improve the efficiency of the algorithms on segmenting images with noise and weak boundary. Furthermore, this constraint term can make edge-based level set model overcome the defect of sensitivity to the initial contour. The experimental results show that our algorithm is efficient for image segmentation and outperform the existing state-of-art methods regarding images with noise and weak boundary.     

New normalized nonlocal hybrid level set method for image segmentation

This article introduces a new normalized nonlocal hybrid level set method for image segmentation. Due to intensity overlapping, blurred edges with complex backgrounds, simple intensity and texture information, such kind of image segmentation is still a challenging task. The proposed method uses both the region and boundary information to achieve accurate segmentation results. The region information can help to identify rough region of interest and prevent the boundary leakage problem. It makes use of normalized nonlocal comparisons between pairs of patches in each region, and a heuristic intensity model is proposed to suppress irrelevant strong edges and constrain the segmentation. The boundary information can help to detect the precise location of the target object, it makes use of the geodesic active contour model to obtain the target boundary. The corresponding variational segmentation problem is implemented by a level set formulation. We use an internal energy term for geometric active contours to penalize the deviation of the level set function from a signed distance function. At last, experimental results on synthetic images and real images are shown in the paper with promising results.     

IMAGE SEGMENTATION BY PIECEWISE CONSTANT MUMFORD-SHAH MODEL WITHOUT ESTIMATING THE CONSTANTS

In this work, we try to use the so-called Piecewise Constant Level Set Method （PCLSM） for the Mumford-Shah segmentation model. For image segmentation, the Mumford-Shah model needs to find the regions and the constant values inside the regions for the segmen- tation. In order to use PCLSM for this purpose, we need to solve a minimization problem using the level set function and the constant values as minimization variables. In this work, we test on a model such that we only need to minimize with respect to the level set function, i.e., we do not need to minimize with respect to the constant values. Gradient descent method and Newton method are used to solve the Euler-Lagrange equation for the minimization problem. Numerical experiments are given to show the efficiency and advantages of the new model and algorithms.     

快速均值漂移图像分割算法研究

Mean shift算法是一种搜索与样本点分布最接近模式的非参数统计方法.但它是一种迭代统计方法,要保证较高的数值计算精度需要较多的迭代次数,耗费较长的计算时间.为克服这一缺点,提出快速均值漂移图像分割算法.该算法在每次迭代时以前一次的聚类中心集合T动态地更新样本集S,并通过使用直方图缩小样本点的搜索范围进一步加快算法的收敛速度.实验结果表明该方法在保证图像分割质量的同时具有较快的收敛速度.     

A fractional order derivative based active contour model for inhomogeneous image segmentation

Segmenting intensity inhomogeneous images is a challenging task for both local and global methods. Some hybrid methods have great advantages over the traditional methods in inhomogeneous image segmentation. In this paper, a new hybrid method is presented, which incorporates image gradient, local environment and global information into a framework, called adaptive-weighting active contour model. The energy or level set functions in the framework mainly include two parts: a global term and local term. The global term aims to enhance the image contrast, and it can also accelerate the convergence rate when minimizing the energy function. The local term integrates fractional order differentiation, fractional order gradient magnitude, and difference image information into the well-known local Chan–Vese model, which has been shown to be effective and efficient in modeling the local information. The local term can also enhance low frequency information and improve the inhomogeneous image segmentation. An adaptive weighting strategy is proposed to balance the actions of the global and local terms automatically. When minimizing the level set functions, regularization can be imposed by applying Gaussian filtering to ensure smoothness in the evolution process. In addition, a corresponding stopping criterion is proposed to ensure the evolving curve automatically stops on true boundaries of objects. Dice similarity coefficient is employed as the comparative quantitative measures for the segmented results. Experiments on synthetic images as well as real images are performed to demonstrate the segmentation accuracy and computational efficiency of the presented hybrid method.     

Adaptive level set evolution starting with a constant function

In this paper, we propose a novel level set evolution model in a partial differential equation (PDE) formulation. According to the governing PDE, the evolution of level set function is controlled by two forces, an adaptive driving force and a total variation (TV)-based regularizing force that smoothes the level set function. Due to the adaptive driving force, the evolving level set function can adaptively move up or down in accordance with image information as the evolution proceeds forward in time. As a result, the level set function can be simply initialized to a constant function rather than the widely-used signed distance function or piecewise constant function in existing level set evolution models. Our model completely eliminates the needs of initial contours as well as re-initialization, and so avoids the problems resulted from contours initialization and re-initialization. In addition, the evolution PDE can be solved numerically via a simple explicit finite difference scheme with a significantly larger time step. The proposed model is fast enough for near real-time segmentation applications while still retaining enough accuracy; in general, only a few iterations are needed to obtain segmentation results accurately.     

一种无重新初始化的水平集方法的错觉轮廓捕捉新方法

在错觉轮廓捕捉模型建立前,我们要得到根据物体边界的符号距离函数时,用Eikonal方程不能实现的,我们用基于水平集方法的分割技术实现,扩大了模型的使用范围;在Zhu和Chan等人的错觉轮廓捕捉模型基础上引入了李纯明等人提出的符号距离约束信息,这就使得在水平集函数演化时不必对其重新初始化,并大大简化了模型的数值处理水平集函数的演化速度.并通过实验验证了该方法的优势.     

Adaptive Segmentation Model for Images with Intensity Inhomogeneity based on Local Neighborhood Contrast

Segmentation of images with intensity inhomogeneity is a significant task in the field of image processing, especially in medical image processing and analysis. Some local region-based models work well on handling intensity inhomogeneity, but they are always sensitive to contour initialization and high noise. In this paper, we present an adaptive segmentation model for images with intensity inhomogeneity in the form of partial differential equation. Firstly, a global intensity fitting term and a local intensity fitting term are constructed by employing the global and local image information, respectively. Secondly, a tradeoff function is defined to adjust adaptively the weight between two fitting terms, which is based on the neighborhood contrast of image pixel. Finally, a weighted regularization term related to local entropy is used to ensure the smoothness of evolution curve. Meanwhile, a distance regularization term is added for stable level set evolution. Experimental results show that the proposed model without initial contour can segment inhomogeneous images stably and effectively, which thereby avoiding the influence of contour initialization on segmentation results. Besides, the proposed model works better on noise images comparing with two relevant segmentation models.     

A fast multiphase level set algorithm for solving the Chan-Vese model

In this work, we specifically solve the C-V active contour model by multiphase level set methods. We first develop a fast algorithm based on calculating the variational energy of the C-V model without the length term. We check whether the energy decreases or not when we move a point to another segmented region. Then we draw a connection between this algorithm and the topological derivative, a concept emerged from the shape optimization field. Furthermore, to include the length term of the C-V model, a preprocessing step is taken by using nonlinear diffusion. Numerical experiments have demonstrated the efficiency and the robustness of our algorithm. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)