共查询到16条相似文献,搜索用时 187 毫秒
1.
针对水平集和区域生长方法都存在对噪声和初始边界敏感以及容易从弱边缘处泄露等不稳定的问题,提出了结合待分割目标灰度统计信息和图像梯度信息的水平集演化函数对水平集方法进行改进,并利用区域生长方法解决水平集方法对初始边界敏感的问题.分别用传统区域生长方法、阈值方法、GAC模型、C-V模型、Snake模型以及本文方法进行从腹部CT图像分割肝脏区域的实验比较,实验结果表明:本文方法不仅可以减少图像分割的时间,而且显著地提高了分割质量. 相似文献
2.
距离规则水平集存在对噪声、初始轮廓敏感、收敛速度慢以及容易从弱边缘处泄露等不稳定问题.结合待分割目标灰度统计信息和图像梯度信息,提出了一种自适应初始轮廓的水平集演化方法,利用图像信息构成的自带符号目标信息函数代替面积项中的边缘指示函数,解决水平集方法对初始轮廓敏感问题.另外,还设计一个自我调整的面积项系数解决水平集方法对收敛速度慢以及弱边缘处泄露问题.实验结果表明:本文方法不仅可以减少图像分割时间,提高了分割质量,同时能够解决对初始轮廓敏感问题. 相似文献
3.
一种鲁棒的非均匀灰度图像分割算法 总被引:2,自引:0,他引:2
针对非均匀灰度图像分割困难及分割效率低下的问题,该文提出了一种基于活动轮廓模型的高效图像分割算法。不同于传统水平集方法中仅用单一信息定义的能量泛函,该算法结合图像的边缘信息和区域统计信息定义了一个新的能量泛函。边缘信息的利用便于演化轮廓线快速精确地定位至物体边缘;区域统计信息由局部统计信息和全局统计信息构成,一方面,局部统计信息的利用能够有效处理图像的灰度分布不均匀现象,另一方面,全局统计信息的利用避免了轮廓线陷入局部极小值。最后,在轮廓线演化过程中,通过高斯卷积核实现快速规则化,避免了传统模型计算代价高昂的重新初始化或规则化。合成图像和真实图像的实验结果表明,该文算法不仅能够快速有效分割灰度分布不均匀的弱边缘物体,而且对于多灰阶复杂结构物体也能够精确分割;同时,该算法对噪声和初始轮廓线具有较好的鲁棒性。 相似文献
4.
5.
一种基于变分水平集的红外图像分割算法 总被引:4,自引:2,他引:2
红外图像大都存在边缘模糊或离散状边缘的特点,并且图像的先验知识较少,因此红外图像的分割是比较困难的。针对这种情况,该文提出了一种基于图像全局信息并且不需要重新初始化的变分水平集红外图像分割方法,不考虑图像边缘梯度的影响,将图像全局信息作为外部能量项,在很大程度上克服了边缘模糊时过分割的情况。同时通过引入内部变形能量约束水平集函数逼近符号距离函数,省去了重新初始化水平集函数的过程,简化了计算,减小了因重新初始化水平集函数带来的误差。将算法应用在红外图像的分割中,验证了算法的有效性。 相似文献
6.
7.
为解决红外图像分割中背景噪声及边界轮廓的影响,引入了基于曲线演化理论、水平集方法和M-S分割函数的C-V模型。通过将图像表达为分段常量函数来建立适当的能量函数模型,引入水平集的表示方法,在整个图像域中依据最小化分割寻找全局极小值,可令活动轮廓最终到达目标边缘。由MATLAB实现的仿真结果表明采用C-V模型对红外图像进行自动分割不受边界轮廓线连续性限制,对初始轮廓线位置不敏感,对图像噪声具有很强的鲁棒性,对均匀灰度目标分割效果良好。 相似文献
8.
9.
10.
现有多区域水平集方法大多利用复杂的能量函数来驱动多个水平集函数的演变,这样不仅模型复杂且存在很多限制.为此本文提出一种基于纹理特征的多区域水平集方法,利用任意数量的水平集函数来对相应数量的图像区域进行分割.本文首先对图像的颜色和纹理信息建立联合分布并将其代入能量函数;引入平滑概率标签,根据概率性质建立基于标签驱动的多区域水平集迭代更新方程.之后将每个水平集投影到离散概率空间得到一系列近似标签,并由这些标签得到基于多区域水平集的先验概率,从而将多个轮廓演变信息代入统计框架.而不同区域的统计参数也通过最小化能量函数由概率标签迭代更新.通过与其他分割算法在大量复杂实景图像上的实验对比,验证了本文算法的有效性. 相似文献
11.
Minimization of region-scalable fitting energy for image segmentation 总被引:34,自引:0,他引:34
Chunming Li Chiu-Yen Kao John C Gore Zhaohua Ding 《IEEE transactions on image processing》2008,17(10):1940-1949
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. 相似文献
12.
13.
14.
Dansong Cheng Feng Tian Lin Liu Xiaofang Liu Ye Jin 《Signal, Image and Video Processing》2018,12(5):895-903
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. 相似文献
15.
《Journal of Visual Communication and Image Representation》2014,25(5):827-839
Brain Magnetic Resonance (MR) images often suffer from the inhomogeneous intensities caused by the bias field and heavy noise. The most widely used image segmentation algorithms, which typically rely on the homogeneity of image intensities in different regions, often fail to provide accurate segmentation results due to the existence of bias field and heavy noise. This paper proposes a novel variational approach for brain image segmentation with simultaneous bias correction. We define an energy functional with a local data fitting term and a nonlocal spatial regularization term. The local data fitting term is based on the idea of local Gaussian mixture model (LGMM), which locally models the distribution of each tissue by a linear combination of Gaussian function. By the LGMM, the bias field function in an additive form is embedded to the energy functional, which is helpful for eliminating the influence of the intensity inhomogeneity. For reducing the influence of noise and getting a smooth segmentation, the nonlocal spatial regularization is drawn upon, which is good at preserving fine structures in brain images. Experiments performed on simulated as well as real MR brain data and comparisons with other related methods are given to demonstrate the effectiveness of the proposed method. 相似文献
16.
针对传统C-V模型对颜色不均匀图像分割失败并且对初始轮廓和位置敏感问题,以及现有符号距离正则项存在周期性振荡和局部极值问题。该文提出结合局部能量信息和改进的符号距离正则项的图像目标分割算法。首先,将全局图像信息扩展到HSV空间,并使用局部能量项信息分析每个像素及其领域内的统计特性,从而在较少的迭代次数内有效分割颜色分布不均匀图像。其次,改进现有符号距离正则项,改进后的符号距离正则项在避免水平集函数的重新初始化的同时,提高了计算效率,保证了水平集函数演化过程的稳定性。然后,定义阈值判断法的水平集函数演化的终止准则,使曲线准确演化到目标轮廓。该算法与同类模型的对比实验表明该模型具有较高的分割精度和对初始轮廓的鲁棒性。 相似文献