Difference between revisions of "Projects:fMRIClustering"

From NAMIC Wiki
Jump to: navigation, search
(New page: Back to NA-MIC_Collaborations, MIT Algorithms = fMRI Clustering = In this work we propose to simultaneously estimate the optimal representati...)
 
 
(113 intermediate revisions by 8 users not shown)
Line 1: Line 1:
  Back to [[NA-MIC_Collaborations|NA-MIC_Collaborations]], [[Algorithm:MIT|MIT Algorithms]]
+
  Back to [[NA-MIC_Internal_Collaborations:fMRIAnalysis|NA-MIC Collaborations]], [[Algorithm:MIT|MIT Algorithms]]
 +
__NOTOC__
 +
= Improving fMRI Analysis using Supervised and Unsupervised Learning =
  
= fMRI Clustering =
+
One of the major goals in the analysis of fMRI data is the detection of regions of the brain with similar functional behavior. A wide variety of methods including hypothesis-driven statistical tests, supervised, and unsupervised learning methods have been employed to find these networks. In this project, we develop novel learning algorithms that enable more efficient inferences from fMRI measurements. 
  
In this work we propose to simultaneously estimate the optimal
+
= Clustering for Discovering Structure in the Space of Functional Selectivity =
representative time courses that summarize the fMRI data well and
 
the partition of the volume into a set of disjoint regions that are best
 
explained by these representative time courses. Our approach offers two
 
advantages. First, is removes the sensitivity of the analysis to the details
 
of the seed selection. Second, it substantially simplifies group analysis
 
by eliminating the need for a subject-specific threshold at which correlation
 
values are deemed significant. This unsupervised technique generalizes
 
connectivity analysis to situations where candidate seeds are di�cult to
 
identify reliably or are unknown. Our experimental results indicate that
 
the functional segmentation provides a robust, anatomically meaningful
 
and consistent model for functional connectivity in fMRI.
 
  
= Description =
+
We are devising clustering algorithms for discovering structure in the functional organization of the high-level visual cortex. It is suggested that there are regions in the visual cortex with high selectivity to certain categories of visual stimuli; we refer to these regions as /functional units/. Currently, the conventional method for detection of these regions is based on statistical tests comparing response of each voxel in the brain to different visual categories to see if it shows considerably higher activation to one category. For example, the well-known FFA (Fusiform Face Area) is the set of voxels which show high activation to face images. We use a model-based clustering approach to the analysis of this type of data as a means to make this analysis automatic and further discover new structures in the high-level visual cortex.
  
''Fiber Tractography''
+
We formulate a model-based clustering algorithm that simultaneously
 +
finds a set of activation profiles and their spatial maps from fMRI time courses. We validate
 +
our method on data from studies of category selectivity in the visual
 +
cortex, demonstrating good agreement with findings from prior
 +
hypothesis-driven methods. This hierarchical model enables functional group analysis
 +
independent of spatial correspondence among subjects. We have also developed a co-clustering extension of this
 +
algorithm which can simultaneously find a set of clusters of voxels and categories
 +
of stimuli in experiments with diverse sets of stimulus categories. Our model is nonparametric, learning the numbers of clusters in both domains as well as the cluster parameters.
  
The goal of fiber tractography is to find open curves (i.e. paths without volume) in the white matter which correspond to something anatomically significant.  In our framework, a direction-dependent Finsler manifold is constructed. Note that Riemannian manifolds based on tensors comprise a subset of all possible Finsler manifolds and are most commonly used in this framework.  Then, the best geodesic path connecting the input ROIs is computed on the manifold. This minimum cost geodesic curve is determined by solving a Hamilton-Jacobi-Bellman (HJB) equation using the Fast Sweeping algorithm. The resulting solution is the anchor tract connecting the two ROIs.
+
Fig. 1 shows the categories learned by our algorithm on a study with 8 subjects. We split trials of each image into two groups of equal size and consider
 +
each group as an independent stimulus forming a total of 138
 +
stimuli. Hence, we can examine the consistency of our stimulus categorization with respect to identical trials. Stimulus pairs
 +
corresponding to the same image are generally assigned to the same
 +
category, confirming the consistency of the resuls across
 +
trials. Category 1 corresponds to the scene images and, interestingly, also includes all images of
 +
trees. This may suggest a high level category structure that is not
 +
merely driven by low level features. Such a structure is even more
 +
evident in the 4th category where images of a tiger that has a large
 +
face join human faces. Some other animals are clustered together with human bodies in categories 2 and
 +
9. Shoes and cars, which have similar shapes, are clustered together
 +
in category 3 while tools are mainly found in category 6.
  
Clinically speaking, the anchor tract has little meaning.  However, during the computation of the anchor tract, connectivity maps are generated as a useful by-product which represent the connectivity of the brain volume to the input ROIs.
 
  
Also, note that in this framework, special care is taken so that the minimum cost (or equivalently the fastest travel time of a particle moving along the curve in the given manifold) and the anisotropic front propagation used to solve the HJB equation are appropriately related through a Legendre transformation. Algorithms which inappropriately ignore the Legendre transformation can severely impact the anisotropy information in front propagation based PDE solvers.
+
{|
 +
|+ '''Fig 1. Categories learned from 8 subjects'''
 +
|align="center"|[[Image:Category_singlefile1.png |thumb|800px]]
 +
|}
  
Recently, we have applied this method to the cingulum bundle, as shown in the following images:
+
Fig. 2 shows the cluster centers, or activation profiles, for the first 13 of 25 clusters learned by our method. We see salient category structure in our profiles. For instance, system 1 shows lower responses to cars, shoes, and tools compared to other stimuli. Since the images representing these three categories in our experiment are generally smaller in terms of pixel size, this system appears selective to lower level features (note that the highest probability of activation among shoes corresponds to the largest shoe 3). System 3 and system 8 seem less responsive to faces compared to all other stimuli.
  
 
{|
 
{|
|+ '''Fig 1. Cingulum Bundle Anchor Tracts'''
+
|+ '''Fig 2. System profiles of posterior probabilities of activation for each system to different stimuli. The bar heights correspond to the posterior probability of activation.'''
|valign="top"|[[Image:Case24-coronal-tensors-edit.png |thumb|250px|Detailed View of the Cingulum Bundle Anchor Tract]]
+
|align="center"|[[Image:Hdpprofs_all_1.png |thumb|800px]]
|valign="top"|[[Image:Case25-sagstream-tensors-edit.png|thumb|250px|Streamline Comparison]]
 
|-
 
|valign="top"|[[Image:Case26-anterior.png |thumb|250px|Anterior View of the Cingulum Bundle Anchor Tract]]
 
|valign="top"|[[Image:Case26-posterior.png|thumb|250px|Posterior View of the Cingulum Bundle Anchor Tract]]
 
 
|}
 
|}
  
''Fiber Bundle Segmentation''
+
Fig. 3 shows the membership maps for the systems 2, 9, and 12, selective for bodies, faces, and scenes, respectively, which our model learns in a completely unsupervised fashion from the data. For comparison, Fig. 4 shows the significance maps found by applying the conventional confirmatory t-test to the data from the same subject. While significance maps appear to be generally larger than the extent of systems identified by our method, a close inspection reveals that system membership maps include the peak voxels for their corresponding contrasts.
 
 
We have developed a region-based active contour segmentation algorithm which provides volumetric fiber segmentations of fiber bundles. These active contours are initialized on the anchor tract and are expanded away from the anchor tract to capture the volumetric fiber bundle.  The basic idea is to evolve the front away from the contour capturing only those voxels which are locally "connected" to the anchor tract.  Cast in a Bayesian framework, this technique includes prior clinical knowledge penalizing bundles with abnormal radii and image-driven likelihood information to accurately capture edges in the directional information.
 
  
 
{|
 
{|
|+ '''Fig 2. Cingulum Bundle Volumetric Fiber Bundles Segmentation Results'''
+
|+ '''Fig 3. Membership probability maps corresponding to systems 22, 9, and 12, selective respectively for bodies (magenta), scenes (yellow), and faces (cyan) in one subject.'''
|valign="top"|[[Image:ResultZoomedOut.png |thumb|250px|Zoomed Out View]]
+
|align="center"|[[Image:Sys_2_9_12_subj1.png |thumb|800px]]
|valign="top"|[[Image:ZoomedResultWithModel.png |thumb|250px|Zoomed In View]]
 
 
|}
 
|}
  
 
{|
 
{|
|+ '''Fig 3. Cingulum Bundle Volumetric Fiber Bundles Surface Evolution'''
+
|+ '''Fig 4. Map representing significance values for three contrasts: bodies-objects (magenta), faces-objects (cyan), and scenes-objects (yellow) in the same subject. Lighter colors correspond to higher significance.'''
|valign="top"|[[Image:PriorFiberResultOverBaseline001.png |thumb|250px|Result from Priors Only (t=1)]]
+
|align="center"|[[Image:Sys_2_9_12_subj1.png |thumb|800px]]
|valign="top"|[[Image:PriorFiberResultOverBaseline003.png |thumb|250px|Result from Priors Only (t=3)]]
 
|valign="top"|[[Image:PriorFiberResultOverBaseline008.png |thumb|250px|Result from Priors Only (t=8)]]
 
|-
 
|valign="top"|[[Image:LikelihoodsFiberResultOverBaseline001.png |thumb|250px|Result from Likelihoods Only (t=1)]]
 
|valign="top"|[[Image:LikelihoodsFiberResultOverBaseline003.png |thumb|250px|Result from Likelihoods Only (t=3)]]
 
|valign="top"|[[Image:LikelihoodsFiberResultOverBaseline008.png |thumb|250px|Result from Likelihoods Only (t=8)]]
 
|-
 
|valign="top"|[[Image:FinalFiberResultOverBaseline001.png |thumb|250px|Result from Combined Likelihoods and Priors (t=1)]]
 
|valign="top"|[[Image:FinalFiberResultOverBaseline003.png |thumb|250px|Result from Combined Likelihoods and Priors (t=3)]]
 
|valign="top"|[[Image:FinalFiberResultOverBaseline008.png |thumb|250px|Result from Combined Likelihoods and Priors (t=8)]]
 
 
|}
 
|}
  
''Data''
+
'''''Earlier work'''''
  
We are using Harvard's high angular resolution datasets which currently consist of a population of 12 schizophrenics and 12 normal controls.
+
Fig. 5 compares the map of voxels assigned to a face-selective profile by an earlier version of our algorithm with the t-test's map of voxels with statistically significant (p<0.0001) response to faces when compared with object stimuli. Note that in contrast with the hypothesis testing method, we don't specify the existence of a face-selective region in our algorithm and the algorithm automatically discovers such a profile of activation in the data.
  
''Associated Results''
+
{|
 
+
|+ '''Fig 5. Spatial maps of the face selective regions found by the statistical test (red) and our mixture model (dark blue). Maps are presented in alternating rows for comparison. Visually responsive mask of voxels used in our experiment is illustrated in yellow and light blue.'''
For previous results showing comparisons of this framework to traditional streamline frameworks and results showing the application of this framework to the segmentation of blood vessels, see [[Algorithm:GATech:DWMRI_Geodesic_Active_Contours_Archive| Associated Results]].
+
|align="center"|[[Image:mit_fmri_clustering_mapffacompare.PNG |thumb|800px]]
 +
|}
  
''Statistical Results''
+
'''''Hierarchical Model for Exploratory fMRI Analysis without Spatial Normalization'''''
  
We are currently investigating Cingulum Bundle fractional anisotropy (FA) differences between a population of 12 schizophrenics and 12 normal controls. We find the anchor tracts as described above and then compute statistics for FA inside a tube of radii 1-3mm centered on the anchor tract. So far using this method we have been unable to find a statistical difference between the normal controls and the schizophrenics. Once we have processed the entire population using our volumetric segmenter, we will rerun the statistics on the full fiber bundle.
+
Building on the work on the clustering model for the domain specificity, we develop a hierarchical exploratory method for simultaneous parcellation of multisub ect fMRI data into functionally coherent areas. The method is based on a solely functional representation of the fMRI data and a hierarchical probabilistic model that accounts for both inter-subject and intra-subject forms of variability in fMRI response. We employ a Variational Bayes approximation to fit the model to the data. The resulting algorithm finds a functional parcellation of the individual brains along with a set of population-level clusters, establishing correspondence between these two levels. The model eliminates the need for spatial normalization while still enabling us to fuse data from several subjects. We demonstrate the application of our method on the same visual fMRI study as before. Fig. 6 shows the scene-selective parcel in 2 different subjects. Parcel-level spatial correspondence is evident in the figure between the subjects.  
  
Download the current statistical results [[Media:ResultsAnchorTube.txt|here.]] (last updated 18/Apr/2007)
+
<table>
 +
<tr> <th> '''Fig 6. The map of the scene selective parcels in two different subjects. The rough location of the scene-selective areas PPA and TOS, identified by the expert, are shown on the maps by yellow and green circles, respectively.'''
 +
<tr>
 +
<td align="center">
 +
[[Image:mit_fmriclustering_hierarchicalppamapsubject1.jpg |650px]]
 +
<td align="center">
 +
[[Image:mit_fmriclustering_hierarchicalppamapsubject2.jpg |650px]]
 +
</table>
  
''Project Status''
 
*Working 3D implementation in Matlab using the C-based Mex functions.
 
*Currently porting to ITK.
 
  
 
= Key Investigators =
 
= Key Investigators =
  
* Georgia Tech: John Melonakos, Vandana Mohan, Sam Dambreville, Allen Tannenbaum
+
* MIT: Danial Lashkari, Archana Venkataraman, Ramesh Sridharan, Ed Vul, Nancy Kanwisher, Polina Golland.
* Harvard/BWH: Marek Kubicki, Marc Niethammer, Kate Smith, C-F Westin, Martha Shenton
+
* Harvard: J. Oh, Marek Kubicki, Carl-Fredrik Westin.
  
 
= Publications =
 
= Publications =
  
''In print''
+
[http://www.na-mic.org/publications/pages/display?search=Projects%3AfMRIClustering&submit=Search&words=all&title=checked&keywords=checked&authors=checked&abstract=checked&sponsors=checked&searchbytag=checked| NA-MIC Publications Database on fMRI clustering]
 
 
[http://www.na-mic.org/Special:Publications?text=Projects%3ADWMRIGeodesicActiveContours&submit=Search&words=all&title=checked&keywords=checked&authors=checked&abstract=checked&sponsors=checked&searchbytag=checked NA-MIC Publications Database]
 
 
 
''In press''
 
 
 
* J. Melonakos, M. Niethammer, V. Mohan, M. Kubicki, J. Miller, and A. Tannenbaum. Locally-Constrained Region-Based Methods for DW-MRI Segmentation.  MMBIA 2007.
 
* V. Mohan, J. Melonakos, M. Niethammer, M. Kubicki, and A. Tannenbaum. Finsler Level Set Segmentation for Imagery in Oriented Domains. BMVC 2007.
 
* J. Melonakos, V. Mohan, M. Niethammer, K. Smith, M. Kubicki, and A. Tannenbaum. Finsler Tractography for White Matter Connectivity Analysis of the Cingulum Bundle. MICCAI 2007 (accepted for oral presentation).
 
* J. Melonakos, E. Pichon, S. Angenet, and A. Tannenbaum. Finsler Active Contours. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007.
 
 
 
= Links =
 
  
* For some additional diffusion-related thoughts, see: [[Algorithm:GATech:DWMRI_Musings | DW-MRI Musings]]
+
Project Week Results: [[2008_Summer_Project_Week:fMRIconnectivity|June 2008]]
  
Project Week Results: [[Media:2007_Project_Half_Week_FinslerTractography.ppt|Jan 2007]], [[Projects/Diffusion/2007_Project_Week_Geodesic_Tractography|June 2007]]
+
[[Category:fMRI]]

Latest revision as of 20:06, 28 November 2012

Home < Projects:fMRIClustering
Back to NA-MIC Collaborations, MIT Algorithms

Improving fMRI Analysis using Supervised and Unsupervised Learning

One of the major goals in the analysis of fMRI data is the detection of regions of the brain with similar functional behavior. A wide variety of methods including hypothesis-driven statistical tests, supervised, and unsupervised learning methods have been employed to find these networks. In this project, we develop novel learning algorithms that enable more efficient inferences from fMRI measurements.

Clustering for Discovering Structure in the Space of Functional Selectivity

We are devising clustering algorithms for discovering structure in the functional organization of the high-level visual cortex. It is suggested that there are regions in the visual cortex with high selectivity to certain categories of visual stimuli; we refer to these regions as /functional units/. Currently, the conventional method for detection of these regions is based on statistical tests comparing response of each voxel in the brain to different visual categories to see if it shows considerably higher activation to one category. For example, the well-known FFA (Fusiform Face Area) is the set of voxels which show high activation to face images. We use a model-based clustering approach to the analysis of this type of data as a means to make this analysis automatic and further discover new structures in the high-level visual cortex.

We formulate a model-based clustering algorithm that simultaneously finds a set of activation profiles and their spatial maps from fMRI time courses. We validate our method on data from studies of category selectivity in the visual cortex, demonstrating good agreement with findings from prior hypothesis-driven methods. This hierarchical model enables functional group analysis independent of spatial correspondence among subjects. We have also developed a co-clustering extension of this algorithm which can simultaneously find a set of clusters of voxels and categories of stimuli in experiments with diverse sets of stimulus categories. Our model is nonparametric, learning the numbers of clusters in both domains as well as the cluster parameters.

Fig. 1 shows the categories learned by our algorithm on a study with 8 subjects. We split trials of each image into two groups of equal size and consider each group as an independent stimulus forming a total of 138 stimuli. Hence, we can examine the consistency of our stimulus categorization with respect to identical trials. Stimulus pairs corresponding to the same image are generally assigned to the same category, confirming the consistency of the resuls across trials. Category 1 corresponds to the scene images and, interestingly, also includes all images of trees. This may suggest a high level category structure that is not merely driven by low level features. Such a structure is even more evident in the 4th category where images of a tiger that has a large face join human faces. Some other animals are clustered together with human bodies in categories 2 and 9. Shoes and cars, which have similar shapes, are clustered together in category 3 while tools are mainly found in category 6.


Fig 1. Categories learned from 8 subjects
Category singlefile1.png

Fig. 2 shows the cluster centers, or activation profiles, for the first 13 of 25 clusters learned by our method. We see salient category structure in our profiles. For instance, system 1 shows lower responses to cars, shoes, and tools compared to other stimuli. Since the images representing these three categories in our experiment are generally smaller in terms of pixel size, this system appears selective to lower level features (note that the highest probability of activation among shoes corresponds to the largest shoe 3). System 3 and system 8 seem less responsive to faces compared to all other stimuli.

Fig 2. System profiles of posterior probabilities of activation for each system to different stimuli. The bar heights correspond to the posterior probability of activation.
Hdpprofs all 1.png

Fig. 3 shows the membership maps for the systems 2, 9, and 12, selective for bodies, faces, and scenes, respectively, which our model learns in a completely unsupervised fashion from the data. For comparison, Fig. 4 shows the significance maps found by applying the conventional confirmatory t-test to the data from the same subject. While significance maps appear to be generally larger than the extent of systems identified by our method, a close inspection reveals that system membership maps include the peak voxels for their corresponding contrasts.

Fig 3. Membership probability maps corresponding to systems 22, 9, and 12, selective respectively for bodies (magenta), scenes (yellow), and faces (cyan) in one subject.
Sys 2 9 12 subj1.png
Fig 4. Map representing significance values for three contrasts: bodies-objects (magenta), faces-objects (cyan), and scenes-objects (yellow) in the same subject. Lighter colors correspond to higher significance.
Sys 2 9 12 subj1.png

Earlier work

Fig. 5 compares the map of voxels assigned to a face-selective profile by an earlier version of our algorithm with the t-test's map of voxels with statistically significant (p<0.0001) response to faces when compared with object stimuli. Note that in contrast with the hypothesis testing method, we don't specify the existence of a face-selective region in our algorithm and the algorithm automatically discovers such a profile of activation in the data.

Fig 5. Spatial maps of the face selective regions found by the statistical test (red) and our mixture model (dark blue). Maps are presented in alternating rows for comparison. Visually responsive mask of voxels used in our experiment is illustrated in yellow and light blue.
Mit fmri clustering mapffacompare.PNG

Hierarchical Model for Exploratory fMRI Analysis without Spatial Normalization

Building on the work on the clustering model for the domain specificity, we develop a hierarchical exploratory method for simultaneous parcellation of multisub ect fMRI data into functionally coherent areas. The method is based on a solely functional representation of the fMRI data and a hierarchical probabilistic model that accounts for both inter-subject and intra-subject forms of variability in fMRI response. We employ a Variational Bayes approximation to fit the model to the data. The resulting algorithm finds a functional parcellation of the individual brains along with a set of population-level clusters, establishing correspondence between these two levels. The model eliminates the need for spatial normalization while still enabling us to fuse data from several subjects. We demonstrate the application of our method on the same visual fMRI study as before. Fig. 6 shows the scene-selective parcel in 2 different subjects. Parcel-level spatial correspondence is evident in the figure between the subjects.

Fig 6. The map of the scene selective parcels in two different subjects. The rough location of the scene-selective areas PPA and TOS, identified by the expert, are shown on the maps by yellow and green circles, respectively.

Mit fmriclustering hierarchicalppamapsubject1.jpg

Mit fmriclustering hierarchicalppamapsubject2.jpg


Key Investigators

  • MIT: Danial Lashkari, Archana Venkataraman, Ramesh Sridharan, Ed Vul, Nancy Kanwisher, Polina Golland.
  • Harvard: J. Oh, Marek Kubicki, Carl-Fredrik Westin.

Publications

NA-MIC Publications Database on fMRI clustering

Project Week Results: June 2008