Fuzzy local Gaussian mixture model for brain MR image segmentation

Accurate brain tissue segmentation from magnetic resonance (MR) images is an essential step in quantitative brain image analysis. However, due to the existence of noise and intensity inhomogeneity in brain MR images, many segmentation algorithms suffer from limited accuracy. In this paper, we assume that the local image data within each voxel's neighborhood satisfy the Gaussian mixture model (GMM), and thus propose the fuzzy local GMM (FLGMM) algorithm for automated brain MR image segmentation. This algorithm estimates the segmentation result that maximizes the posterior probability by minimizing an objective energy function, in which a truncated Gaussian kernel function is used to impose the spatial constraint and fuzzy memberships are employed to balance the contribution of each GMM. We compared our algorithm to state-of-the-art segmentation approaches in both synthetic and clinical data. Our results show that the proposed algorithm can largely overcome the difficulties raised by noise, low contrast, and bias field, and substantially improve the accuracy of brain MR image segmentation.     

An improved image graph for semi-automatic segmentation

The problem of semi-automatic segmentation has attracted much interest over the last few years. The Random Walker algorithm [1] has proven to be quite a popular solution to this problem, as it is able to deal with several components and models the image using a convenient graph structure. We propose two improvements to the image graph used by the Random Walker method. First, we propose a new way of computing the edge weights. Traditionally, such weights are based on the similarity between two neighbouring pixels, using their greyscale intensities or colours. We substitute a new definition of weights based on the probability distributions of colours. This definition is much more robust than traditional measures, as it allows for textured objects, and objects that are composed of multiple perceptual components. Second, the traditional graph has a vertex set which is the set of pixels and edges between each pair of neighbouring pixels. We substitute a smaller, irregular graph based on Mean Shift oversegmentation. This new graph is typically several orders of magnitude smaller than the original image graph, which can lead to a major savings in computing time. We show results demonstrating the substantial improvement achieved when using the proposed image graph.     

改进BIRCH算法的MRI脑图像分割

针对现有磁共振常规扫描序列对于颅脑白质、灰质信号相近分辨不清,解剖病变欠佳,难以达到临床高精准诊断的需求,选用改进的BIRCH算法,首先将3维MRI体数据经过预处理,由灰度与梯度组成特征向量,然后利用Cophenet相关系数,确定最优参数---分支因子B、阈值T,最后通过定义可调节线段L,改进原BIRCH算法仅将数据样...     

一种改进的噪声图像语义分割方法

在图像的获取和传输过程中,可能会出现噪声, 它不仅破坏了图像的真实信息,而且严重影响了图像的视觉效果。因此, 噪声图像的语义分割成为图像分析中最具挑战性的问题之一。为了提高噪声图像的分割性能 ,本文在分析全卷积网络(FCN)的 基础上,提出一种改进的FCN模型(IFCN)对噪声图像语义分割。该算法采用一种新的中值 池化方法代替卷积神经网络的最大值 池化,可以在去除噪声的同时保留更多边缘信息。在训练整个深度网络时,通过反向传播算 法以一种直接的端到端,像素到像素 的方式映射。实验结果表明,提出的模型在PASCAL VOC2012数据集上对噪声图像语义分割 可以获得比较好的分割效果,准确率mean IU达到86.5%。     

改进的全卷积神经网络的脑肿瘤图像分割

针对现有机器学习算法分割脑肿瘤图像精度不高的问题,提出一种基于改进的全卷积神经网络的脑肿瘤图像分割算法。算法首先将FLAIR、T2和T1C三种模态的MR脑肿瘤图像进行灰度归一化,随后利用灰度图像融合技术得到肿瘤信息更加全面的预处理图像;然后采用融合三次脑肿瘤特征信息的改进全卷积神经网络对预处理图像进行粗分割,并且在每个卷积层后加入批量正则化层以加快网络训练的收敛速度,提高训练模型精度;最后融合全连接条件随机场细化粗分割结果中的脑肿瘤边界。实验结果表明,相较于传统的卷积神经网络脑肿瘤图像分割算法,本算法在分割精度和稳定性上有了较大提升,平均Dice可达91.29%,实时性较好,利用训练模型平均1s内可完成单张脑肿瘤图像的分割。      

A simplified texture gradient method for improved image segmentation

Inspired by the probability of boundary (Pb) algorithm, a simplified texture gradient method has been developed to locate texture boundaries within grayscale images. Despite considerable simplification, the proposed algorithm’s ability to locate texture boundaries is comparable with Pb’s texture boundary method. The proposed texture gradient method is also integrated with a biologically inspired model, to enable boundaries defined by discontinuities in both intensity and texture to be located. The combined algorithm outperforms the current state-of-art image segmentation method (Pb) when this method is also restricted to using only local cues of intensity and texture at a single scale.     

一种改进的Laplacian SVM的SAR图像分割算法

当有标识的样本数量有限时,Laplacian SVM算法需要加入尽量多的无标识样本,以提高分类精度.但同时当无标识样本数很大时,算法的时间和空间复杂度将难以接受.为了将Laplacian SVM应用于SAR图像分割这样的大规模分类问题中,提出了一种改进的Laplacian支持向量机算法(Improved Laplaci...     

基于多模态融合的2D MR脑肿瘤图像分割算法研究

针对不同模态MR脑肿瘤图像呈现的肿瘤状态差异以及卷积神经网络(convolutional neural networks, CNNs)提取特征局限性的问题,提出了一种基于多模态融合的MR脑肿瘤图像分割方法。分割模型以U-net网络为原型,创新一种多模态图像融合方式以加强特征提取能力,同时引入通道交叉注意力机制(channel cross transformer, CCT)代替U-net中的跳跃连接结构,进一步弥补深浅层次的特征差距与空间依赖性,有效融合多尺度特征,加强对肿瘤的分割能力。实验在BraTS数据集上进行了多目标分割结果验证,通过定量分析对比前沿网络分割结果,表明该方法确有良好的分割性能,其分割出三种肿瘤区域的Dice系数分别达到80%、74%、71%。     

基于改进遗传神经网络的MR脑组织图像分割方法

为了提高MR脑组织图像分割的准确度,针对传统BP神经网络算法存在的问题,提出了改进的遗传神经网络算法。首先根据医学图像改进遗传算法的编码方式、适应度函数以及遗传操作,利用该算法获取最小适应度函数值,进而确定神经网络最优权值和阈值;然后将该神经网络用于MR脑部图像的分割。试验结果表明,改进的遗传神经网络算法分割效果优于传统BP神经网络算法。     

利用模糊特征改进Snakes模型的图像分割

利用模糊特征自适应地控制曲线法向力场改进参数主动轮廓模型,改进后的模型可以对弱边缘、无边缘区域和纹理图像进行分割。曲线法向力场加速了曲线收敛到目标区域边界,改进了抓取范围和提取凹区域的能力。对弱边缘图像、医学图像和纹理的分割实验表明,新方法具有良好的性能。     

一种改进的维吾尔文字图像分割算法研究

针对复杂背景下维吾尔文字图像分割时产生缺陷和干扰问题,提出一种自适应二值势函数目标模糊C均值算法。首先,使用自适应势目标二值函数聚类方法来获取集群的维吾尔文字二值图像分割和聚类中心,然后利用其隶属度矩阵的最佳数量确定模糊计算维吾尔文字图像分割模糊聚类的维吾尔文字图像。实验结果表明,该算法可以实现维吾尔文字图像的自适应分割,准确地分割出维吾尔文字区域部分,同时极大地减少了计算复杂性,有利于实现维吾尔文字图像处理的准确度。     

一种改进的核可能性C-均值聚类图像分割算法

可能性C-均值聚类(PCM)算法比传统模糊C-均值聚类算法具有更好的鲁棒性,但其应用于图像分割时没有充分考虑图像的局部空间信息。基于PCM算法,提出一种核空间与自适应中值滤波相结合的改进算法。算法利用自适应中值滤波获得像素的局部空间信息,并由此生成一种新的模糊因子加入到目标函数中,然后在核空间中对目标函数进行优化求解,得到最优聚类中心和隶属度。由实验结果可知,所提算法对被高椒盐噪声污染的图像具有较高的准确性和鲁棒性。     

基于最佳分割目标优化的医学图像分割方法

针对医学图像中组织边缘模糊、灰度不均匀、图像噪声高的问题,将改进的布谷鸟算法和信息熵结合,提出一种基于改进布谷鸟算法优化最大熵的医学图像分割方法。通过改进的布谷鸟算法优化最大熵法确定图像的最佳分割门限,在此基础上完成最佳分割点的分割。在多个实验样本上的测试结果表明,文中提出的新方法在很大程度上解决了过去几种方法的缺陷,使得分割速度与精度明显提升,另一方面,其鲁棒性也相对理想,适用于实际应用。     

A hierarchical algorithm for MR brain image parcellation

We introduce an algorithm for segmenting brain magnetic resonance (MR) images into anatomical compartments such as the major tissue classes and neuro-anatomical structures of the gray matter. The algorithm is guided by prior information represented within a tree structure. The tree mirrors the hierarchy of anatomical structures and the subtrees correspond to limited segmentation problems. The solution to each problem is estimated via a conventional classifier. Our algorithm can be adapted to a wide range of segmentation problems by modifying the tree structure or replacing the classifier. We evaluate the performance of our new segmentation approach by revisiting a previously published statistical group comparison between first-episode schizophrenia patients, first-episode affective psychosis patients, and comparison subjects. The original study is based on 50 MR volumes in which an expert identified the brain tissue classes as well as the superior temporal gyrus, amygdala, and hippocampus. We generate analogous segmentations using our new method and repeat the statistical group comparison. The results of our analysis are similar to the original findings, except for one structure (the left superior temporal gyrus) in which a trend-level statistical significance (p = 0.07) was observed instead of statistical significance.     

STACS: new active contour scheme for cardiac MR image segmentation

The paper presents a novel stochastic active contour scheme (STACS) for automatic image segmentation designed to overcome some of the unique challenges in cardiac MR images such as problems with low contrast, papillary muscles, and turbulent blood flow. STACS minimizes an energy functional that combines stochastic region-based and edge-based information with shape priors of the heart and local properties of the contour. The minimization algorithm solves, by the level set method, the Euler-Lagrange equation that describes the contour evolution. STACS includes an annealing schedule that balances dynamically the weight of the different terms in the energy functional. Three particularly attractive features of STACS are: 1) ability to segment images with low texture contrast by modeling stochastically the image textures; 2) robustness to initial contour and noise because of the utilization of both edge and region-based information; 3) ability to segment the heart from the chest wall and the undesired papillary muscles due to inclusion of heart shape priors. Application of STACS to a set of 48 real cardiac MR images shows that it can successfully segment the heart from its surroundings such as the chest wall and the heart structures (the left and right ventricles and the epicardium.) We compare STACS' automatically generated contours with manually-traced contours, or the "gold standard," using both area and edge similarity measures. This assessment demonstrates very good and consistent segmentation performance of STACS.     

基于改进的CV模型的医学图像分割

基于CV模型的水平集分割是医学图像分割的一个重要的分割手段。医学图像分割要求精度高,速度快。传统的处理方式效率比较低,不能满足医学图像的分割要求。针对这一缺点,本文提出新的分割模式。首先,在分割过程中间断的对图像进行窗口化处理,减少演化过程所需计算的数据量。同时使活动轮廓的演化速度伴随窗口规模进行调整,减少演变所需的迭代次数。实验表明,改进之后分割方法能够极大的提高分割速度,同时图像细节部分的分割也有更高的精度。     

基于可变区域拟合水平集算法的改进

基于可变区域拟合水平集算法利用图像的局部区域信息,在活动曲线演化控制参数的手工设置使其应用受到了限制。本文提出了将灰度信息图像匹配原理应用到RSF模型中,根据计算相邻演化图像的相关系数实现迭代的自适应停止。实验结果表明,改进的RSF模型克服了自动设置迭代次数的缺点,实现了迭代的自适应停止,而且对弱边缘不连续图像能够有效地实现,节省了时间,提高了分割效率。     

一种基于脑部肿瘤MR图像的分割方法

针对传统的分割方法难以实现医学图像自动分割和准确分割的问题,提出了一种基于GVF Snake模型的医学图像分割方法。该方法采用Canny算子的边缘检测结果作为GVF扩散方程计算的边缘映射图,提高了GVF Snake模型的抗噪性能;用分水岭算法自动获取的轮廓作为GVF Snake模型分割的初始轮廓,降低了GVF力场计算的复杂性和分割时轮廓线的迭代次数。分析和实验结果表明,采用该方法对脑部肿瘤MR图像进行分割时,能自动准确地分割出肿瘤区域。     

Markov random field segmentation of brain MR images

Describes a fully-automatic three-dimensional (3-D)-segmentation technique for brain magnetic resonance (MR) images. By means of Markov random fields (MRF's) the segmentation algorithm captures three features that are of special importance for MR images, i.e., nonparametric distributions of tissue intensities, neighborhood correlations, and signal inhomogeneities. Detailed simulations and real MR images demonstrate the performance of the segmentation algorithm. In particular, the impact of noise, inhomogeneity, smoothing, and structure thickness are analyzed quantitatively. Even single-echo MR images are well classified into gray matter, white matter, cerebrospinal fluid, scalp-bone, and background. A simulated annealing and an iterated conditional modes implementation are presented