Automatic Identification of ROIs (Regions of interest) in fMRI data.

Slides:



Advertisements
Similar presentations
FMRI Methods Lecture 10 – Using natural stimuli. Reductionism Reducing complex things into simpler components Explaining the whole as a sum of its parts.
Advertisements

Cluster Analysis of fMRI Data Using Dendrogram Sharpening L. Stanberry, R. Nandy, and D. Cordes Presenter: Abdullah-Al Mahmood.
Cluster Analysis: Basic Concepts and Algorithms
Hierarchical Clustering, DBSCAN The EM Algorithm
Robust statistical method for background extraction in image segmentation Doug Keen March 29, 2001.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
G. Folino, A. Forestiero, G. Spezzano Swarming Agents for Discovering Clusters in Spatial Data Second International.
Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
fMRI data analysis at CCBI
Using Contiguous Bi-Clustering for data driven temporal analysis of fMRI based functional connectivity.
Clustering II.
Dissociating the neural processes associated with attentional demands and working memory capacity Gál Viktor Kóbor István Vidnyánszky Zoltán SE-MRKK PPKE-ITK.
Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Cluster Analysis: Basic Concepts and Algorithms
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
Introduction to Hierarchical Clustering Analysis Pengyu Hong 09/16/2005.
Introduction to Bioinformatics - Tutorial no. 12
What is Cluster Analysis?
Clustering An overview of clustering algorithms Dènis de Keijzer GIA 2004.
Connectivity of aMRI and fMRI data Keith Worsley Arnaud Charil Jason Lerch Francesco Tomaiuolo Department of Mathematics and Statistics, McConnell Brain.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
From Localization to Connectivity and... Lei Sheu 1/11/2011.
MATISSE - Modular Analysis for Topology of Interactions and Similarity SEts Igor Ulitsky and Ron Shamir Identification.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Bayesian networks Classification, segmentation, time series prediction and more. Website: Twitter:
1 CSE 980: Data Mining Lecture 17: Density-based and Other Clustering Algorithms.
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
FMRI Methods Lecture7 – Review: analyses & statistics.
2004 All Hands Meeting Analysis of a Multi-Site fMRI Study Using Parametric Response Surface Models Seyoung Kim Padhraic Smyth Hal Stern (University of.
Uncovering Overlap Community Structure in Complex Networks using Particle Competition Fabricio A. Liang
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
Clustering What is clustering? Also called “unsupervised learning”Also called “unsupervised learning”
Hierarchical Clustering of Gene Expression Data Author : Feng Luo, Kun Tang Latifur Khan Graduate : Chien-Ming Hsiao.
Module networks Sushmita Roy BMI/CS 576 Nov 18 th & 20th, 2014.
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
Differential analysis of Eigengene Networks: Finding And Analyzing Shared Modules Across Multiple Microarray Datasets Peter Langfelder and Steve Horvath.
Some questions -What is metadata? -Data about data.
CZ5225: Modeling and Simulation in Biology Lecture 3: Clustering Analysis for Microarray Data I Prof. Chen Yu Zong Tel:
Gene expression & Clustering. Determining gene function Sequence comparison tells us if a gene is similar to another gene, e.g., in a new species –Dynamic.
CURE: EFFICIENT CLUSTERING ALGORITHM FOR LARGE DATASETS VULAVALA VAMSHI PRIYA.
Presented by Ho Wai Shing
Cluster validation Integration ICES Bioinformatics.
The Bi-Module problem: new algorithms and applications Group meeting January 2013 David Amar.
Hierarchical Clustering
Computational Biology Group. Class prediction of tumor samples Supervised Clustering Detection of Subgroups in a Class.
CZ5211 Topics in Computational Biology Lecture 4: Clustering Analysis for Microarray Data II Prof. Chen Yu Zong Tel:
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Robotics Chapter 6 – Machine Vision Dr. Amit Goradia.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.
Clustering Microarray Data based on Density and Shared Nearest Neighbor Measure CATA’06, March 23-25, 2006 Seattle, WA, USA Ranapratap Syamala, Taufik.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
Clustering [Idea only, Chapter 10.1, 10.2, 10.4].
Clustering (2) Center-based algorithms Fuzzy k-means Density-based algorithms ( DBSCAN as an example ) Evaluation of clustering results Figures and equations.
Graph clustering to detect network modules
Machine Vision ENT 273 Lecture 4 Hema C.R.
More on Clustering in COSC 4335
CSE 4705 Artificial Intelligence
Data Mining K-means Algorithm
Greedy Algorithm for Community Detection
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
The Development of Human Functional Brain Networks
Text Categorization Berlin Chen 2003 Reference:
Hierarchical Clustering
The Development of Human Functional Brain Networks
Presentation transcript:

Automatic Identification of ROIs (Regions of interest) in fMRI data

Data Blood-oxigen levels in high spatial resolution (low temporal resolution). ~160,000 voxels ~25,000 voxels of gray matter TRs (time points per signal). The data is highly correlated (mean 0.25 after removing the main effect).

Goal To map the functional role of each area. Identify areas that work together in common tasks (referred to as “Functional Networks”). Study dynamic processes within and between such networks. * Many of these functions and roles have already been identified.

Handling Noise Standard pre-processing: adjusting for head movements, normalization to a standard space (to allow comparing different subjects). Mask for grey matter only. Removing the main effect: for each time point, reduce the average signal of the brain on that time point.

Identifying networks– functional connectivity Perform voxel wise comparison against one/multiple pre-defined regions of interest (ROIs) -> “functional network”. No ROI: Voxel based clustering (mainly ICA).

How do we define ROIs? Lu et. Al – split-merge based method. Use Kendall’s Coefficient of Concordance (KCC) to measure regional homogeneity. At each step measure KCC, split if required, measure KCC, merge if possible. Add singleton neighbors to each block if correlation>thresh K K1 K4K3 2K2K K1 K4K3 K1 K3

How do we define ROIs? Bellec et. Al – use mutual nearest neighbor principle as merging rule (size limit). Stop when no more merging is possible. Clustering (Hierarchical, ICA, etc.)+proximity filter.Does not use the regional behavior to reduce complexity.

Suggested Method Sample many voxel neighboring pairs (e.g. 10,000) to obtain correlation threshold (C th ). For each voxel (v i ) go over all neighbors, and assign to the group of the first neighbor v j for which corr(v i,G(v j ))> C th. Corr(v i,G(v j )) is the correlation between the signal of v i and the mean signal of G(v J ).

Refinements Consult with neighbours in border (search for similarity of v i to the mean signal of the group and to the neighbours of v i that belong to the group). Helps prevents structures that are poorly connected. E.g.

Pros & Cons Fast Works with a threshold that considers the entire brain (does not impose grouping). Completely data driven. But… Finding the right correlation threshold. Naïve approach – takes the first “friend”, may not be robust enough. Many results - how do we know what is “real”?

Tests Was tested on 5 motor datasets (moving left hand and right hand). In some of the cases, the areas expected to be active* were detected in some cases this did not happen. * Note: assumption, if it is currently used, it should be highly correlated.

Matisse Identifies modules using gene expression data and interaction networks. Integrative analysis - can identify weaker signals Identifies a group of genes as well as the connections between them Only variant genes (front nodes) have meaningful similarity values These can be linked by not regulated genes (back nodes) Works even when only a fraction of the genes expression patterns are informative No need to pre-specify the number of modules

Attempt to use Matisse Use MATISSE to detect adjacent groups of voxels that are highly correlated. Similarity Matrix was replaced with adjacency list to decrease memory usage. Memory problems – MATISSE underwent optimizations by Dorit & Eyal – needs to be retested.

ROI border improvements In most cases the general location of the ROI is known. The exact borders need to be defined Use an arbitrary area – e.g sphere – problematic. Define borders based on the data

ROI border improvements Input: an initial pre-defined ROI At each step: 1) Remove marginal voxels that decrease homogeneity. 2) Add neighboring voxels increase homogeneity. Stop when the improvement is below a predefined delta. Output: a functionally homogeneous ROI

Tested on a very simple motor dataset. Detected the center of activation using another tool. Generated an artificial area around it (a cube of size 7*7*7). Fed this area into the algorithm. Results: 3 voxels left. Preliminary tests

Problems When do we stop? We can keep peeling off voxels until there is only one/few left. Shape of the area