- Journal List
- NIHPA Author Manuscripts
- PMC2483677

# Generalized Fuzzy Clustering for Segmentation of Multi-Spectral Magnetic Resonance Images

^{}Sushmita Datta, Ph.D., Balasrinivasa Rao Sajja, Ph.D., and Ponnada A. Narayana, Ph.D.

^{}Corresponding author.

## Abstract

An integrated approach for multi-spectral segmentation of MR images is presented. This method is based on the fuzzy c-means (FCM) and includes bias field correction and contextual constraints over spatial intensity distribution and accounts for the non-spherical cluster’s shape in the feature space. The bias field is modeled as a linear combination of smooth polynomial basis functions for fast computation in the clustering iterations. Regularization terms for the neighborhood continuity of intensity are added into the FCM cost functions. To reduce the computational complexity, the contextual regularizations are separated from the clustering iterations. Since the feature space is not isotropic, distance measure adopted in Gustafson-Kessel (G-K) algorithm is used instead of the Euclidean distance, to account for the nonspherical shape of the clusters in the feature space. These algorithms are quantitatively evaluated on MR brain images using the similarity measures.

**Keywords:**Adaptive FCM, Contextual constraints, G-K algorithm, Inhomogeneity field, Multispectral segmentation, MRI, Similarity measures

## 1. Introduction

The superb soft tissue contrast seen on magnetic resonance imaging (MRI) is ideally suited for tissue classification and volumetry. This has significant implications in understanding the neural basis for many neurological disorders [19]. For instance, in a number of neurological disorders, such as multiple sclerosis (MS) and Alzheimer’s disease, the volume changes in total brain, gray matter (GM), and white matter (WM) provide important information about the neuronal and axonal loss [4, 25, 26]. In addition, MRI-derived tissue volumetry is increasingly employed as a secondary end point in many clinical trials [22]. Accurate and robust tissue classification or segmentation is critical for detecting changes in tissue volumes in healthy and diseased brain. Commonly used techniques for segmentation have been recently reviewed [24].

A unique feature of MRI is its multi-model nature that allows acquisition of images with different tissue contrasts (T1-, T2-, density-weighting etc.) It is possible to improve the quality of segmentation by combining information from images with multiple contrasts [3, 13, 16, 32]. Feature map-based classification techniques for MR image segmentation have attracted considerable attention because they are fast, simple to implement, and allow expert’s input in tissue classification. However, in practice, this multi-spectral segmentation is prone to false tissue classifications and requires significant manual intervention and pre-processing since the distribution of intensities in the feature space is distorted by various factors that include image intensity inhomogeneity arising from the radio frequency receiver and transmitter coil profiles, partial volume averaging effects from the limited resolution, image noise, and spatial misalignment of images. While there are a few methods to overcome some of these problems, we focus on fuzzy c-means (FCM) based methods [1, 8, 10, 23, 27, 28, 31, 33] because of their many desirable features in tissue classification.

Conventional FCM-based methods do not correct the intensity inhomogeneity and do not exploit contextual information. The adaptive FCM (AFCM) incorporates the intensity inhomogeneity correction, contextual constraints to overcome the noise problems and fuzzy membership to address the partial volume averaging effect, and automatic clustering [1, 20, 23, 27, 28, 30, 34].

One essential problem with adaptive FCM (and a number of other clustering algorithms) is that they are totally based on the objective cost function. Therefore, the performance of the algorithms is greatly dependent on the way the objective cost function is constructed. When using the Euclidean distance in the objective cost function, as in FCM, the algorithm has a tendency to generate equal cluster volumes with spherical occupancy in the feature space [8, 14]. This could have a significant effect on the MRI segmentation results. To deal with this problem, a few methods have been proposed in MR image segmentation in which some pre-selected seeds are included [5, 6]. Methods aimed at automating the selection of seeds are proposed by Sucking et al. [30]. However, these methods are cumbersome to implement. In order to automatically produce reasonable clusters, more sophisticated distance measure is included in the Gustafson-Kessel (G-K) algorithm [15, 17] in which a positive definite, symmetric scatter matrix (or covariance matrix) is used instead of the Euclidean distance to define the Mahalanobis distance to form an ellipsoidal cluster in the feature space. In the G-K algorithm each cluster is characterized by a symmetric and positive definite matrix for automatic adaptation of each individual cluster volume.

The fundamentals of fuzzy clustering in medical image segmentation are well described in Sutton et al. [31]. The main formalism presented in this paper is based on the grouped coordinate descent method (also called alternating optimization (AO)) [31]. Important details, such as singularity, initialization, rules of thumb for the parameters, methods to determine the number of clusters are not described in this paper due to space limitation, but can be found elsewhere [17]. Throughout this paper, we assumed that the total number of clusters is known and that proper initialization is available.

In the current studies, we extended AFCM to multispectral segmentation that included efficient intensity non-uniformity (or bias field) correction and contextual constraints over neighborhood spatial intensity distribution. The nonspherical occupancy of the feature space was accounted by utilizing cluster scatter measures to define the Mahalanobis distance. This method was applied to segment GM, WM and CSF of MR images acquired with fast spin echo (FSE) pulse sequence which is commonly used in the routine clinical practice. The performance of the algorithm was quantitatively evaluated using similarity measures.

## 2. Methods and Materials

### 2.1. Multi-spectral adaptive FCM

This section describes the extension of the original adaptive FCM [1] to multi-spectral case with the inclusion of contextual constraints [1][27] to obtain a general cost function. This extension to the original AFCM is referred to as generalized FCM (GFCM). The objective function of the conventional FCM for clustering *n*-channel image data, **x**_{k}, *k* = 1,…,*N*, into *c*-classes can be expressed as

subject to

where *u*_{ik} is the membership of *k*-th voxel belonging to class-*i*, **v**_{i} is the cluster center of class-*i*, and *p* is a preset weighting exponent or fuzzifier. To include the influence of immediate neighborhood for forcing the solution towards piecewise-homogeneous labeling, regularization terms are introduced into the objective function as suggested by others [1, 20, 27]. With the inclusion of the regularization terms, Eq. (1) can be written as

where *N*_{k} represents the neighbors of current voxel, and *N*_{R} is the cardinality of *N*_{k}. The regularization term can be adjusted by setting the value of α corresponding to neighborhood constraints in Eq. (3) to compromise between the sharp segmentation and the pulse noise [1, 27].

In general, the distribution of MR image intensities in the feature space is distorted due to the presence of bias field that needs to be corrected for proper tissue classification. The intensity of a voxel located at the spatial position *k* (*k* = 1,…, *N*, where *N* is the number of voxels) can be represented as [28]

where **o**_{k} is the observed intensity, **t**_{k} is the true intensity, **G**_{k} is the diagonal matrix representing the gain field, and **noise**(*k*) is the noise. Since we are mainly interested in multi-spectral case, all the above variables, except **G**_{k}, are vectors. Assuming *n* image channels, we can explicitly express **o**_{k}=[*o*_{k1},*o*_{k2},…,*o _{kn}*]

^{T}and

**t**

_{k}=[

*t*

_{k1},

*t*

_{k2},…,

*t*]

_{kn}^{T}. The gain field can be denoted as

**g**

_{k}=[

*g*

_{k1},

*g*

_{k2},…,

*g*]

_{kn}^{T}, with

**G**

_{k}=

**diag**(

*g*

_{k1},

*g*

_{k2},…,

*g*) and Eq. (4) can be rewritten as

_{kn} By ignoring the noise term and applying the log-transform on both sides of Eq. (5), denoting the log-transformed observed MR image data as **y**_{k} and the log-transformed true intensity of underlying tissues as **x**_{k}, the MR image data can be approximated as [1, 23]

where **b**_{k}=[*b*_{k1},*b*_{k2},…,*b _{kn}*]

^{T}is the vectorial voxel representation of the bias field.

Generally, the bias field can be approximated as *b _{kl}*=∑

_{i}

*q*

_{li}*ϕ*(

_{i}*P*) where

_{k}*ϕ*(

_{i}*p*)is a smooth basis function and

_{k}*p*represents the coordinates. Therefore

_{k}

*b*_{k}can be written as

with

and

where *m* is the number of basis functions in Φ. The whole bias field can be expressed as

In practice, the approximation of the bias field is over the 3D space and the spatial relation have to be included into the expansion of the smooth basis functions.

By the piecewise homogeneous assumption, the influence of the bias field is included in the objective function (Eq. 3). Introducing a normalizing factor **e,** the modified objective function can be written as

subject to

Since the amplitude, **b**_{k}, is arbitrary, normalization of **b**_{k} is necessary to ascertain that the sum of **b**_{k} is zero to satisfy the convergence condition of *alternating optimization* (AO). The normalization factor, **e,** will maintain the sum of **b**_{k} to zero and plays an important role in the convergence of the iterations in the AO that can be applied to Eq. (9) to arrive at the (local) optima. The image segmentation is achieved by solving

### 2.2. Extension of AFCM algorithm with G-K measure

Since the Euclidean distance measure is used in the objective function to compute the distance between data points and prototypes of clusters, FCM method works well for the spherical shaped clusters with equal volumes. To take the cluster shape into consideration, we incorporate the covariance matrix of each cluster into the calculation of distance measures using Gustafson-Kessel (G-K) algorithm as described in the following section.

In the G-K algorithm, a more sophisticated distance measure, the Mahalanobis distance, based on positive definite, symmetric scatter matrix (or covariance matrix) is used to account for the scatter shape of each cluster and the ellipsoidal occupancy of clusters in the feature space [15]. The fuzzy covariance matrix, **S**_{i}, is given by [15, 17]

We describe the algorithm for extending the G-K algorithm to multi-channel MR image segmentation by denoting

and

where ${\mathbf{A}}_{i}=\sqrt[n]{\text{det}\phantom{\rule{thinmathspace}{0ex}}\left({\mathbf{S}}_{i}\right)}{\mathbf{S}}_{i}^{-1}$ [15, 17] denotes the norm matrix. The Lagrangean multiplier is adopted to include the constraints into the optimization, and the augmented objective function becomes

Taking the derivative of *F*_{m} with respect to *u*_{ik} for *p* >1, and equating to zero, and with the constraint $\sum _{j=1}^{c}{u}_{jk}=1,$ we get

For a positive definite matrix **L**, for any vector x, we know that

Taking the derivative of *F*_{m} with respect to **v**_{i} and equating to zero, and using the result in Eqn. (16) with the property ${\mathbf{A}}_{i}^{-1}{\mathbf{A}}_{i}\phantom{\rule{thinmathspace}{0ex}}=\phantom{\rule{thinmathspace}{0ex}}\mathbf{I},$ we have

Similarly, the bias field can be estimated by equating the derivative of *F*_{m} with respect to **b**_{k} to zero and using the matrix derivative result

we have

Let

Eq. (19) can be written as

which equals to

where represents the Kronecker product in Eqn. (24). The definition of “:” in Eqn. (24) is as fellow: for arbitrary matrix **W**, the note “**W**:” is defined as the vector formed by concatenating all the columns of matrix **W**, e.g. if **h** = **W**_{[m×n]}:, then *h*_{i+m(j-1)} = *w*_{i,j}. Therefore we have

The computation of **Q** is fast since the dimensions of **O** and **M** are small. The above solutions lead to the smooth approximation of the bias field as

As before, the smoothed **b*** _{k}* should be normalized to eliminate the arbitrary value of the amplitude of

**b**

_{k}and ascertain that the sum of

**b**

_{k}is zero to satisfy the convergence condition of AO.

### 2.3. Image Acquisition

For evaluation of the above algorithms on actual brain images, dual fast spin echo (FSE) MR images of the whole brain (from vertex to foramen magnum) were acquired on 13 healthy normal volunteers (3 women and 10 men; age range 23 to 55 years). Since the dual echo images are acquired in an interleaved manner, the images are in perfect registration with each other and do not require post-acquisition image alignment. Images were acquired either on a General Electric (1.5 T) or a Philips (3 T) scanner, with the following parameters: field-of-view of 240 mm × 240 mm, image matrix of 256 × 256, and echo train length of 8. A quadrature birdcage resonator was used both for RF transmission and signal reception at 1.5 T using the following parameters: TE1/TE2/TR = 12 ms/ 86 ms/6800 ms, where TE and TR represent the echo and repetition times respectively. A total of 42 contiguous and interleaved slices, each of 3 mm thick, were acquired. On the Philips 3T Intera scanner a six channel SENSE coil was used for signal reception while the whole body coil was used for RF transmission. A SENSE factor of 2 was used for these scans. MR images were acquired with the following scan parameters: TE1/TE2/TR = 9.5ms/90ms/6800 ms. The total number of slices at 3T was 44, each of 3 mm thick.

Prior to segmentation, the extrameningeal tissues from the images were removed using a semi-automatic procedure that is described elsewhere [12, 29] and these stripped brain images were used as the input to the algorithms. The output of the algorithms included inhomogeneity corrected images, cluster centers, bias field, and memberships of the image volume. All the proposed algorithms were implemented under Interactive Data Language (IDL) environment in Windows.

### 2.4. Evaluation

Initially, the performance of the GFCM algorithm was evaluated quantitatively using the BrainWeb images. The BrainWeb images consist of 3 mm thick normal proton density (PD) and T2 weighted images with 3% noise and 40% inhomogeneity added. We assumed the number of clusters to be four and our results suggest this number to be appropriate (see the “Results and Discussion” for the rationale for using four clusters). For the BrainWeb images these four clusters represent white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF), and dura matter that is consistent with Sucking et al. [30]. This is different from most of the studies performed using the single-channel images (such as T1 weighted) where usually only 3 classes - WM, GM, and CSF- are included [1, 20, 23, 34].

The convergence of clustering iterations is controlled by the *L*_{2} norm of the cluster center’s difference between two consecutive iterations (denoted by ε). Two values for ε were used: ε=0.05 and 0.01. At least visually, the clustering results for the two ε values were comparable, as assessed by an expert, but the computation cost for the smaller value of ε was almost twice. For instance, the computational time for AFCM was around 1 minute for ε=0.05, but around 2 minutes for ε=0.01. Therefore the value of ε=0.05 was chosen to generate the initial inputs to the G-K algorithm using the AFCM. Other parameters that control the contextual constraints are indicated at the relevant places. All the segmentation (clustering) was performed in two-dimensional feature space.

For quantitative comparison of segmentation based on AFCM and G-K algorithms, we compared the tissue volumes (*Seg*) based on the segmentation of the BrainWeb images, with the reference volumes (*Ref*) generated by the ground truth (using the crisp data) and computing the four similarity measures defined in Eq. (27) – Eq. (30) [2]. In these equations, *POE*, *PUE*, *PCE* refer to the over-, under-, and the correctly estimated percentage of tissue volumes, respectively, and *SI* is the similarity index.

The performance of the algorithm was also evaluated using the above procedure on the. FSE images of normal human brain. In this case, the segmentation by an expert neurologist (more than 20 years of experience in MRI of MS) was considered as the ground truth. The segmentation by the expert was based on automatic segmentation using the method proposed by Sajja et al [29], followed by manual validation. For the FSE images these four classes primarily represent WM, GM, CSF, and GM+CSF. Without the inclusion of GM+CSF as a separate cluster, the large spread between GM and CSF in the feature space led to less favorable classification results.

## 3. Results and Discussion

The BrainWeb images were segmented into four tissue classes: WM, GM, CSF, and dura matter. The intensity inhomogeneity correction was performed iteratively along with the classification of tissues as described in the ”Methods and Materials”. As mentioned earlier, the BrainWeb images were classified using the neighborhood contextual constraint based on intensity [1]. In these studies α was set to 0.01 to balance between the ability in overcoming noise and the effect of blurring the segmentation; the power of the membership, *p*, was set to 2 for all studies. For the contextual constraints in 3D the direct neighborhood was set to 26. We observed that the inclusion of neighborhood contextual constraints in the AO iterations did slow down the process significantly. Therefore, the contextual constraints were applied only when the clustering without contextual constraints was completed. The iteration with contextual constraints required only limited number of loops (one loop in our studies).

As an example, images segmented using the GFCM along with the corresponding BrainWeb image at one slice location are shown in Figure 1. As can be seen from these images, GFCM, at least visually, has provided quite satisfactory results. Table 1 summarizes the quantitative evaluation of AFCM and GFCM based on the similarity measures for all the segmented tissues. The performance of GFCM can be appreciated by the high values of the similarity index. A comparison of the results in Tables 1 clearly shows that G-K algorithm improved all the similarity measures.

The FSE images were classified into four classes: GM, WM, CSF and GM+CSF. The use of four clusters in the FSE images (GM, WM, CSF, GM+CSF) can also be rationalized by the fact that the proximity of CSF and GM, particularly in the cortex, often results in significant overlap between these two tissues. As an example Figure 2 shows the segmentation (membership) of one section of brain in the cerebellar region. It is known that on the FSE images the tissue intensities in the cerebellar regions are different from those of the superior parts of the brain [30]. These intensity differences can not be corrected by merely applying the inhomogeneity correction. Therefore, the cerebellar and the posterior fossa regions are very difficult to segment using automatic techniques [29, 30, 34] and the segmentation of the cerebellum area is usually performed by adopting regional or localized methods [29, 30, 34]. Thus, it is gratifying that segmentation of the cerebellar region has been considerably improved with GFCM.

Inclusion of the G-K algorithm to account for the nonspherical occupancy of the feature space is a major component of GFCM. Therefore, we quantitatively evaluated the importance of G-K algorithm by segmenting the Brain Web and FSE images with and without incorporation of the G-K algorithm and comparing the results with the ground truth using the similarity measures described above. The improvement in the tissue segmentation by including the G-K algorithm was also visually evaluated on the FSE images. Figure 3 shows the segmentation of Brain Web images with and without the contextual constraints for G-K algorithm, and Table 1 summarizes the quantitative comparisons. After the G-K algorithm without the contextual constraints was completed, only a single iteration was performed following the application of the contextual constraints. It is important to point out that the inclusion of neighborhood intensity based contextual constraint places increased computational burden. Further optimization of α and number of iterations is necessary for improving the performance of contextual constraint.

**...**

The same iteration stop criteria and contextual constraints used for the Brain Web images were employed for the FSE images. It should be pointed out that the FSE images were hard segmented to include only the three pure classes, GM, WM, and CSF (through winner takes all on the membership). Inclusion of three pure classes is necessary since the mixed class can not be delineated by the human expert. Table 2 – Table 5 summarize the SI, POE, PUE and PCE for the FSE images on 13 normal volunteers. Figure 4 shows the similarity measures (SI and PCE) for all the 13 FSE images with contextual constraints for α=0.01, 0.001, 0.005, and 0.0005. It can be seen from these plots that the results are relatively insensitive to the value of α over a wide range. Because of the space limitations, we included only SI and PCE, the two more important similarity measures, in these plots.

Figure 5 shows the PD and T2 weighted FSE images at different locations. The corresponding segmented images with AFCM, GFCM, and GFCM with contextual constraint (α=0.01) are shown in Figs. 5c–e, respectively. Consistent with the quantitative analysis based on the similarity measures, these images demonstrate that visually GFCM performed better than AFCM, and GFCM with and without contextual constraint provided comparable results.

It is difficult to quantitatively compare our results with other published results since very few publications evaluated the performance of the segmentation using the metrics employed in the current studies. Of the four similarity measures employed in these studies, SI is considered to be the most important metric since it is a measure of the agreement between the proposed segmentation and the ground truth. Higher the SI value, better is the agreement. The high SI values (~90%) that we achieved for segmented BrinWeb images, where the ground truth is known, suggests excellent performance of the GFCM method. The SI value for the FSE images, however, is slightly lower, particularly for the CSF. This slightly lower value perhaps is due to the fact that the ground truth is not known in this case. Our results also demonstrate the improved performance of GFCM relative to AFCM. We did not observe significant differences in the segmentation quality by including the contextual constraint. However, this conclusion is based on limited studies without complete optimization of the parameters (α and number of iterations).

In these studies we have included only normal brains. Additional dimensions (such as FLAIR images) in the feature space may be required to increase the separability of more classes such as lesions [3, 13, 16].

## 5. Conclusions

A comprehensive GFCM technique for multispectral segmentation of MR images is described. This technique incorporates an efficient bias field correction along with contextual constraints. In addition, this method takes into account the nonspherical occupancy of the feature space by replacing the Eucledian distance with cluster scatter measures to define the Mahalanobis distance. Qualitative and quantitative evaluation on Brain Web and real brain images indicates that GFCM outperforms the AFCM method.

## Acknowledgments

This work is supported by the National Institutes of Health grants EB002095 and 1 S10 RR19186. We acknowledge Vipulkumar Patel for acquiring the FSE images.

## Biographies

**Renjie He,** He got his Ph.D. in Electrical Engineering with specialization in Biomedical Engineering from Tsinghua University, Beijing, China, in 1998, he is assistant professor with Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston.

**Sushmita Datta,** She got her Ph.D. in mathematics form Indian Institute of Technology, Kanpur, India, in 2003, she is research associate of Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston.

**Balasrinivasa Rao Sajja**, He got his Ph.D. in mathematics form Indian Institute of Technology, Kanpur, India, in 2002, he is assistant professor with Department of radiology, University of Nebraska Medical Center.

**Ponnada Narayana,** He got his Ph.D. in Physics from Indian Institute of Technology, Kanpur, India, in 1969, He is professor with Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston.

## Footnotes

**Publisher's Disclaimer: **This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final citable form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

## Contributor Information

Renjie He, Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston, 6431 Fannin Street, Houston, TX 77030, Tel: (713)500-7621, Fax: (713)500-7684, Email: ude.cmt.htu@eH.eijneR.

Sushmita Datta, Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston, 6431 Fannin Street, Houston, TX 77030, Tel: (713)500-7597, Fax: (713)500-7684, Email: ude.cmt.htu@attaD.atimhsuS.

Balasrinivasa Rao Sajja, Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston, 6431 Fannin Street, Houston, TX 77030, Tel: (713)500-7680, Fax: (713)500-7684, Email: ude.cmt.htu@ajjaS.R.asavinirsalaB.

Ponnada A. Narayana, Department of Diagnostic and Interventional Imaging, University of Texas Medical School at Houston, 6431 Fannin Street, Houston, TX 77030, Tel: (713)500-7677, Fax: (713)500-7684, Email: ude.cmt.htu@anayaraN.A.adannoP.

## References

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (1.5M) |
- Citation

- Volume and shape in feature space on adaptive FCM in MRI segmentation.[Ann Biomed Eng. 2008]
*He R, Sajja BR, Datta S, Narayana PA.**Ann Biomed Eng. 2008 Sep; 36(9):1580-93. Epub 2008 Jun 24.* - Local bone enhancement fuzzy clustering for segmentation of MR trabecular bone images.[Med Phys. 2010]
*Folkesson J, Carballido-Gamio J, Eckstein F, Link TM, Majumdar S.**Med Phys. 2010 Jan; 37(1):295-302.* - A modified possibilistic fuzzy c-means clustering algorithm for bias field estimation and segmentation of brain MR image.[Comput Med Imaging Graph. 2011]
*Ji ZX, Sun QS, Xia DS.**Comput Med Imaging Graph. 2011 Jul; 35(5):383-97. Epub 2011 Jan 22.* - A fast and automatic segmentation method of MR brain images based on genetic fuzzy clustering algorithm.[Conf Proc IEEE Eng Med Biol Soc. 2007]
*Nie S, Zhang Y, Li W, Chen Z.**Conf Proc IEEE Eng Med Biol Soc. 2007; 2007:5628-33.* - Disease cluster statistics for imprecise space-time locations.[Stat Med. 1996]
*Jacquez GM.**Stat Med. 1996 Apr 15-May 15; 15(7-9):873-85.*

- Classification of Multicolor Fluorescence In Situ Hybridization (M-FISH) Images With Sparse Representation[IEEE transactions on nanobioscience. 2012]
*Cao H, Deng HW, Li M, Wang YP.**IEEE transactions on nanobioscience. 2012 Jun; 11(2)111-118* - Spatial based Expectation Maximizing (EM)[Diagnostic Pathology. ]
*Balafar MA.**Diagnostic Pathology. 6103* - Improved Cerebellar Tissue Classification on Magnetic Resonance Images of Brain[Journal of magnetic resonance imaging : JMR...]
*Datta S, Tao G, He R, Wolinsky JS, Narayana PA.**Journal of magnetic resonance imaging : JMRI. 2009 May; 29(5)1035-1042*

- PubMedPubMedPubMed citations for these articles

- Generalized Fuzzy Clustering for Segmentation of Multi-Spectral Magnetic Resonan...Generalized Fuzzy Clustering for Segmentation of Multi-Spectral Magnetic Resonance ImagesNIHPA Author Manuscripts. Jul 2008; 32(5)353

Your browsing activity is empty.

Activity recording is turned off.

See more...