点对称距离模糊C均值聚类算法在脑部MRI图像分割中的应用

背景：在传统的图像分割方法中,模糊C均值聚类算法应用十分广泛。目的：将改进的模糊C均值聚类算法应用到MRI图像的分割中,提高MRI图像分割的准确度。方法：针对传统的基于Minkowski距离的模糊C均值聚类算法,提出了基于点对称距离的模糊C均值聚类算法,并将其运用到了脑部MRI图像分割中。结果与结论：实验结果表明,与模糊C均值聚类算法相比,点对称距离的模糊C均值聚类算法有明显的优势。     

模糊K—均聚类算法及其在磁共振颅脑图像分割中的应用研究

目的 介绍一种动态模糊聚类算法并和该算法对磁共振图像进行分割研究。方法 首先对磁共振颅脑图像进行预处理去掉颅骨和肌肉等非脑组织,只保留大脑组织,然后利用模糊Ｋ－均值聚类算法计算脑白质、脑灰质和脑脊液的模糊类属函数。结果 模糊Ｋ－均值聚类算法能很好地分割出磁共振颅脑图像中的灰质、白质和脑脊液。结论 利用模糊Ｋ－均值聚类算法分割磁共振颅脑图像能获得较好的分割效果。     

模糊K-均值聚类算法及其在磁共振颅脑图像分割中的应用研究

目的　介绍一种动态模糊聚类算法并利用该算法对磁共振图像进行分割研究。方法　首先对磁共振颅脑图像进行预处理去掉颅骨和肌肉等非脑组织,只保留大脑组织,然后利用模糊Ｋ－ 均值聚类算法计算脑白质、脑灰质和脑脊液的模糊类属函数。结果　模糊Ｋ－ 均值聚类算法能很好地分割出磁共振颅脑图像中的灰质、白质和脑脊液。结论　利用模糊Ｋ－ 均值聚类算法分割磁共振颅脑图像能获得较好的分割效果。     

一种改进的模糊核聚类算法

针对传统模糊核聚类算法当数据类差别很大时,小数据类被误分或被大数据类吞并的缺陷,提出了一种改进的模糊核聚类算法;通过定义一个新的目标函数,为每一个类分配了一个动态权值,可改善聚类效果.文中给出的MRI图像分割算例表明了该算法的有效性.     

基于小波的磁共振图像聚类分割

目的 利用直方图自适应确定人体不同部位MRI的聚类类别的数目和相应的初始聚类中心,实现模糊-c均值聚类算法(FCM)分割的自适应。方法 首先采用小波变换拟合直方图的平滑包络线,降低噪声对寻找包络线极值的影响;其次根据微积分的知识求出包络线极大值的个数,按照文中给出的法则对包络线的极大值进行筛选,确定直方图中峰值的个数;最后以直方图中峰值的个数为聚类类别数,以相应的峰值为初始聚类中心,对MRI进行FCM分割。结果 采用该方法对多幅腹部和脑部MR图像进行分割,均能有效地自适应确定聚类的个数。结论 本文方法能够有效、准确地确定不同MR图像的聚类类别的个数,实现FCM的自适应。     

改进模糊C-均值分割算法在多发性硬化症MR脑部图像中的应用

背景:脑部MR图像是一种无纹理的图像,未被噪声污染的脑部MR图像的灰度值具有分片为常数的特点.因此,在聚类过程中灰度值有趋向于在同一个分割区域中相对接近的性质.目的:寻找一个能够自动分割多发性硬化症病灶的模糊C-均值改进方法,为临床对于多发性硬化症的判断提供更方便的工具.方法:考虑到脑部MR图像相邻象素属于同一分类的概率相近的特性,在迭代过程中对8邻域数据集进行滤波以降低噪声对聚类精度的影响,提出了一种改进的模糊C-均值聚类算法.就是将模糊C-均值聚类算法迭代过程中得到的灰度值看作一个数据集,用每个象素邻域象素的灰度值修正该象素的模糊隶属度取值,从而达到利用空间信息抑制噪声的目的.结果与结论:选取了10个多发性硬化症患者的脑部MRI图像进行试验.通过对多发性硬化症患者MR T1脑部图像和T2液体衰减反转回复脑部图像的分割实验,结果显示该算法能够有效分割多发性硬化症病灶,与其他方法所做的多发性硬化症病灶分割相比,本算法更易于实现,运算时间短,同时结果与临床医生的勾画比较重叠率较高,对其临床辅助诊断具有重要作用.     

改进模糊C-均值分割算法在多发性硬化症MR脑部图像中的应用

背景：脑部MR图像是一种无纹理的图像,未被噪声污染的脑部MR图像的灰度值具有分片为常数的特点。因此,在聚类过程中灰度值有趋向于在同一个分割区域中相对接近的性质。目的：寻找一个能够自动分割多发性硬化症病灶的模糊C-均值改进方法,为临床对于多发性硬化症的判断提供更方便的工具。方法：考虑到脑部MR图像相邻象素属于同一分类的概率相近的特性,在迭代过程中对8邻域数据集进行滤波以降低噪声对聚类精度的影响,提出了一种改进的模糊C-均值聚类算法。就是将模糊C-均值聚类算法迭代过程中得到的灰度值看作一个数据集,用每个象素邻域象素的灰度值修正该象索的模糊隶属度取值,从而达到利用空间信息抑制噪声的目的。结果与结论：选取了10个多发性硬化症患者的脑部MRI图像进行试验。通过对多发性硬化症患者MRT1脑部图像和T2液体衰减反转回复脑部图像的分割实验,结果显示该算法能够有效分割多发性硬化症病灶,与其他方法所做的多发性硬化症病灶分割相比,本算法更易于实现,运算时间短,同时结果与临床医生的勾画比较重叠率较高,对其临床辅助诊断具有重要作用。     

模糊聚类支持向量机在步态分类中的应用

背景:对于患有神经系统或骨骼肌肉系统疾病的患者,分析步态数据可以评定康复程度,制定治疗方案。如何有效地分类小样本步态数据成为重要的研究课题。目的:用改进的支持向量机算法对小样本步态数据进行分类,准确诊断疾病。方法:建立加入模糊C均值聚类的支持向量机算法,选用Gait Dynamics in Neuro-Degenerative Disease Data Base40～59岁年龄段的6组数据,共720个样本数据,采用左摆间隔和左支撑间隔两维参数对步态数据建模。数据归一化后,通过模糊C均值聚类对数据进行预处理;然后用支持向量机对数据进行分类。采用不同核函数的支持向量机算法验证分类能力。结果与结论:实验结果表明,利用改进的支持向量机算法,可以有效地对信号进行分类,有助于疾病的诊断和治疗方案的制定。     

模糊聚类支持向量机在步态分类中的应用

背景：对于患有神经系统或骨骼肌肉系统疾病的患者,分析步态数据可以评定康复程度,制定治疗方案。如何有效地分类小样本步态数据成为重要的研究课题。目的：用改进的支持向量机算法对小样本步态数据进行分类,准确诊断疾病。方法：建立加入模糊C均值聚类的支持向量机算法,选用Gait Dynamics in Neuro-Degenerative Disease Data Base40～59岁年龄段的6组数据,共720个样本数据,采用左摆间隔和左支撑间隔两维参数对步态数据建模。数据归一化后,通过模糊C均值聚类对数据进行预处理;然后用支持向量机对数据进行分类。采用不同核函数的支持向量机算法验证分类能力。结果与结论：实验结果表明,利用改进的支持向量机算法,可以有效地对信号进行分类,有助于疾病的诊断和治疗方案的制定。     

基于K-Means及K-NN的磁共振颅脑图像分割初探

目的对K-均值聚类(K-Means)和K-最近邻规则(K-NN)方法在MR颅脑图像分割中的应用进行研究,分析二者优缺点并提出改进。方法利用K-Means算法和K-NN算法对脑组织进行分割。为了减少人脑的劳动使算法自动进行,提出使用K-Means方法提取K-NN方法的训练样本。结果 K-Means与K-NN及改良后的K-NN算法(KMN)能很好地从大脑结构中分割白质(white matter,WM)、灰质(grey matter,GM)和脑脊液(cerebrospinal fluid,CSF)。结论实验表明K-Means与K-NN能快速有效地分割脑组织,改进后的K-NN方法减少了人工参与,并能获得较好的分割效果。     

Comparative assessment of statistical brain MR image segmentation algorithms and their impact on partial volume correction in PET

Magnetic resonance imaging (MRI)-guided partial volume effect correction (PVC) in brain positron emission tomography (PET) is now a well-established approach to compensate the large bias in the estimate of regional radioactivity concentration, especially for small structures. The accuracy of the algorithms developed so far is, however, largely dependent on the performance of segmentation methods partitioning MRI brain data into its main classes, namely gray matter (GM), white matter (WM), and cerebrospinal fluid (CSF). A comparative evaluation of three brain MRI segmentation algorithms using simulated and clinical brain MR data was performed, and subsequently their impact on PVC in 18F-FDG and 18F-DOPA brain PET imaging was assessed. Two algorithms, the first is bundled in the Statistical Parametric Mapping (SPM2) package while the other is the Expectation Maximization Segmentation (EMS) algorithm, incorporate a priori probability images derived from MR images of a large number of subjects. The third, here referred to as the HBSA algorithm, is a histogram-based segmentation algorithm incorporating an Expectation Maximization approach to model a four-Gaussian mixture for both global and local histograms. Simulated under different combinations of noise and intensity non-uniformity, MR brain phantoms with known true volumes for the different brain classes were generated. The algorithms' performance was checked by calculating the kappa index assessing similarities with the "ground truth" as well as multiclass type I and type II errors including misclassification rates. The impact of image segmentation algorithms on PVC was then quantified using clinical data. The segmented tissues of patients' brain MRI were given as input to the region of interest (RoI)-based geometric transfer matrix (GTM) PVC algorithm, and quantitative comparisons were made. The results of digital MRI phantom studies suggest that the use of HBSA produces the best performance for WM classification. For GM classification, it is suggested to use the EMS. Segmentation performed on clinical MRI data show quite substantial differences, especially when lesions are present. For the particular case of PVC, SPM2 and EMS algorithms show very similar results and may be used interchangeably. The use of HBSA is not recommended for PVC. The partial volume corrected activities in some regions of the brain show quite large relative differences when performing paired analysis on 2 algorithms, implying a careful choice of the segmentation algorithm for GTM-based PVC.     

Adaptive, template moderated, spatially varying statistical classification

A novel image segmentation algorithm was developed to allow the automatic segmentation of both normal and abnormal anatomy from medical images. The new algorithm is a form of spatially varying statistical classification, in which an explicit anatomical template is used to moderate the segmentation obtained by statistical classification. The algorithm consists of an iterated sequence of spatially varying classification and nonlinear registration, which forms an adaptive, template moderated (ATM), spatially varying statistical classification (SVC). Classification methods and nonlinear registration methods are often complementary, both in the tasks where they succeed and in the tasks where they fail. By integrating these approaches the new algorithm avoids many of the disadvantages of each approach alone while exploiting the combination. The ATM SVC algorithm was applied to several segmentation problems, involving different image contrast mechanisms and different locations in the body. Segmentation and validation experiments were carried out for problems involving the quantification of normal anatomy (MRI of brains of neonates) and pathology of various types (MRI of patients with multiple sclerosis, MRI of patients with brain tumors, MRI of patients with damaged knee cartilage). In each case, the ATM SVC algorithm provided a better segmentation than statistical classification or elastic matching alone.     

一种基于ITK脑部MRI混合分割方法的设计与实现

背景：由于脑部MR图像中信息对比度不高,各种脑部组织的形状复杂等特点,分割方法的选择比较困难,单一的算法很难获得满意的分割结果。目的：针对脑部MRI的特点综合利用现有的算法开发和定制有效的分割应用算法。方法：根据邻域连接和Canny水平集分割算法的优缺点,结合图像特征,用邻域连接方法的分割结果作为Canny水平集分割算法的先验分割模型,借以确定出Canny算法的下限阈值,从而完成两种算法的混合分割。结果与结论：采用实验所用混合方法得到的白质和灰质的分割结果,经与专家手工分割结果对比,证明该方法取得了较好的分割效果,从而证明综合利用现有的算法,不仅避免了重复劳动,还能开发和定制出更加有效的分割应用算法,具备很好的应用潜力。     

Neuro-Fuzzy Approach Toward Segmentation of Brain MRI Based on Intensity and Spatial Distribution

Segmentation in image processing finds immense application in various areas. Image processing techniques can be used in medical applications for various diagnoses. In this article, we attempt to apply segmentation techniques to the brain images. Segmentation of brain magnetic resonance images (MRI) can be used to identify various neural disorders. We can segment abnormal tissues from the MRI, which and can be used for early detection of brain tumors. The segmentation, when applied to MRI, helps in extracting the different brain tissues such as white matter, gray matter and cerebrospinal fluid. Segmentation of these tissues helps in determining the volume of these tissues in the three-dimensional brain MRI. The study of volume changes helps in analyzing many neural disorders such as epilepsy and Alzheimer disease. We have proposed a hybrid method combining the classical Fuzzy C Means algorithm with neural network for segmentation.     

Neighbourhood approximation using randomized forests

Leveraging available annotated data is an essential component of many modern methods for medical image analysis. In particular, approaches making use of the “neighbourhood” structure between images for this purpose have shown significant potential. Such techniques achieve high accuracy in analysing an image by propagating information from its immediate “neighbours” within an annotated database. Despite their success in certain applications, wide use of these methods is limited due to the challenging task of determining the neighbours for an out-of-sample image. This task is either computationally expensive due to large database sizes and costly distance evaluations, or infeasible due to distance definitions over semantic information, such as ground truth annotations, which is not available for out-of-sample images.This article introduces Neighbourhood Approximation Forests (NAFs), a supervised learning algorithm providing a general and efficient approach for the task of approximate nearest neighbour retrieval for arbitrary distances. Starting from an image training database and a user-defined distance between images, the algorithm learns to use appearance-based features to cluster images approximating the neighbourhood structured induced by the distance. NAF is able to efficiently infer nearest neighbours of an out-of-sample image, even when the original distance is based on semantic information. We perform experimental evaluation in two different scenarios: (i) age prediction from brain MRI and (ii) patch-based segmentation of unregistered, arbitrary field of view CT images. The results demonstrate the performance, computational benefits, and potential of NAF for different image analysis applications.     

Deep learning facilitates fully automated brain image registration of optoacoustic tomography and magnetic resonance imaging

Multispectral optoacoustic tomography (MSOT) is an emerging optical imaging method providing multiplex molecular and functional information from the rodent brain. It can be greatly augmented by magnetic resonance imaging (MRI) which offers excellent soft-tissue contrast and high-resolution brain anatomy. Nevertheless, registration of MSOT-MRI images remains challenging, chiefly due to the entirely different image contrast rendered by these two modalities. Previously reported registration algorithms mostly relied on manual user-dependent brain segmentation, which compromised data interpretation and quantification. Here we propose a fully automated registration method for MSOT-MRI multimodal imaging empowered by deep learning. The automated workflow includes neural network-based image segmentation to generate suitable masks, which are subsequently registered using an additional neural network. The performance of the algorithm is showcased with datasets acquired by cross-sectional MSOT and high-field MRI preclinical scanners. The automated registration method is further validated with manual and half-automated registration, demonstrating its robustness and accuracy.     

Multi-scale patch and multi-modality atlases for whole heart segmentation of MRI

A whole heart segmentation (WHS) method is presented for cardiac MRI. This segmentation method employs multi-modality atlases from MRI and CT and adopts a new label fusion algorithm which is based on the proposed multi-scale patch (MSP) strategy and a new global atlas ranking scheme. MSP, developed from the scale-space theory, uses the information of multi-scale images and provides different levels of the structural information of images for multi-level local atlas ranking. Both the local and global atlas ranking steps use the information theoretic measures to compute the similarity between the target image and the atlases from multiple modalities. The proposed segmentation scheme was evaluated on a set of data involving 20 cardiac MRI and 20 CT images. Our proposed algorithm demonstrated a promising performance, yielding a mean WHS Dice score of 0.899 ± 0.0340, Jaccard index of 0.818 ± 0.0549, and surface distance error of 1.09 ± 1.11 mm for the 20 MRI data. The average runtime for the proposed label fusion was 12.58 min.     

Segmentation of MRI brain scans using non-uniform partial volume densities

We present an algorithm that provides a partial volume segmentation of a T1-weighted image of the brain into gray matter, white matter and cerebrospinal fluid. The algorithm incorporates a non-uniform partial volume density that takes the curved nature of the cortex into account. The pure gray and white matter intensities are estimated from the image, using scanner noise and cortical partial volume effects. Expected tissue fractions are subsequently computed in each voxel. The algorithm has been tested for reliability, correct estimation of the pure tissue intensities on both real (repeated) MRI data and on simulated (brain) images. Intra-class correlation coefficients (ICCs) were above 0.93 for all volumes of the three tissue types for repeated scans from the same scanner, as well as for scans with different voxel sizes from different scanners with different field strengths. The implementation of our non-uniform partial volume density provided more reliable volumes and tissue fractions, compared to a uniform partial volume density. Applying the algorithm to simulated images showed that the pure tissue intensities were estimated accurately. Variations in cortical thickness did not influence the accuracy of the volume estimates, which is a valuable property when studying (possible) group differences. In conclusion, we have presented a new partial volume segmentation algorithm that allows for comparisons over scanners and voxel sizes.