Mindboggle: A scatterbrained approach to automate brain labeling

Slides:



Advertisements
Similar presentations
WMH Replacement and Image Warping Evan Fletcher. Purpose of method Use warping to compile statistical profiles of WMH distributions Use warping to compile.
Advertisements

VBM Voxel-based morphometry
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
MRI preprocessing and segmentation.
Automatic determination of skeletal age from hand radiographs of children Image Science Institute Utrecht University C.A.Maas.
Co-registration and Spatial Normalisation Nazanin Derakshan Eddy Davelaar School of Psychology, Birkbeck University of London.
OverviewOverview Motion correction Smoothing kernel Spatial normalisation Standard template fMRI time-series Statistical Parametric Map General Linear.
The BRAINs Orientation
Automatically Annotating and Integrating Spatial Datasets Chieng-Chien Chen, Snehal Thakkar, Crail Knoblock, Cyrus Shahabi Department of Computer Science.
Coregistration and Normalisation By Lieke de Boer & Julie Guerin.
Automatic Feature Extraction for Multi-view 3D Face Recognition
Each pixel is 0 or 1, background or foreground Image processing to
Preprocessing II: Between Subjects John Ashburner Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.
An Integrated Pose and Correspondence Approach to Image Matching Anand Rangarajan Image Processing and Analysis Group Departments of Electrical Engineering.
1 of 40 Lecture 4-Neuroanatomy Walter Schneider When we talk about the brain we need to be able to identify and communicate clearly on what part of the.
Brain Mapping Unit The General Linear Model A Basic Introduction Roger Tait
Analysis of fMRI data with linear models Typical fMRI processing steps Image reconstruction Slice time correction Motion correction Temporal filtering.
OPTIMIZATION OF FUNCTIONAL BRAIN ROIS VIA MAXIMIZATION OF CONSISTENCY OF STRUCTURAL CONNECTIVITY PROFILES Dajiang Zhu Computer Science Department The University.
Coregistration and Spatial Normalisation
Digital Image Processing CCS331 Relationships of Pixel 1.
2004 All Hands Meeting Analysis of a Multi-Site fMRI Study Using Parametric Response Surface Models Seyoung Kim Padhraic Smyth Hal Stern (University of.
Line detection Assume there is a binary image, we use F(ά,X)=0 as the parametric equation of a curve with a vector of parameters ά=[α 1, …, α m ] and X=[x.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Feature based deformable registration of neuroimages using interest point and feature selection Leonid Teverovskiy Center for Automated Learning and Discovery.
Statistical Parametric Mapping Lecture 11 - Chapter 13 Head motion and correction Textbook: Functional MRI an introduction to methods, Peter Jezzard, Paul.
NA-MIC National Alliance for Medical Image Computing Evaluating Brain Tissue Classifiers S. Bouix, M. Martin-Fernandez, L. Ungar, M.
Date of download: 5/28/2016 Copyright © 2016 SPIE. All rights reserved. Flowchart of the computer-aided diagnosis (CAD) tool. (a) Segmentation: The region.
Ki-Chang Kwak. Average Brain Templates Used for Registration.
南台科技大學 資訊工程系 Region partition and feature matching based color recognition of tongue image 指導教授:李育強 報告者 :楊智雁 日期 : 2010/04/19 Pattern Recognition Letters,
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Multiple Organ detection in CT Volumes Using Random Forests
Assessment of data acquisition parameters, and analysis techniques for noise reduction in spinal cord fMRI data  R.L. Bosma, P.W. Stroman  Magnetic Resonance.
Image Representation and Description – Representation Schemes
Group Averaging of fMRI Data
Real-Time Soft Shadows with Adaptive Light Source Sampling
Statistical Analysis of M/EEG Sensor- and Source-Level Data
Surface-based Analysis: Inter-subject Registration and Smoothing
Voxel-based Morphometric Analysis
Surface-based Analysis: Intersubject Registration and Smoothing
Morphological differences in the LGN in dyslexia
Machine Learning Basics
Mean Shift Segmentation
Surface-based Analysis: Intersubject Registration and Smoothing
Tensor-based Surface Modeling and Analysis
CSc4730/6730 Scientific Visualization
Computational Neuroanatomy for Dummies
Lior Shmuelof, Ehud Zohary  Neuron 
A Similarity Retrieval System for Multimodal Functional Brain Images
Voxel-based Morphometric Analysis
Detecting Gray Matter Maturation via Tensor-based Surface Morphometry
Sequential effects of propofol on functional brain activation induced by auditory language processing: an event-related functional magnetic resonance.
Caspar M. Schwiedrzik, Winrich A. Freiwald  Neuron 
Voxel-based Morphometric Analysis
Caspar M. Schwiedrzik, Winrich A. Freiwald  Neuron 
Figure 3 Anatomical distribution of all implanted electrodes
The Generality of Parietal Involvement in Visual Attention
Volume 26, Issue 7, Pages (April 2016)
Jack Grinband, Joy Hirsch, Vincent P. Ferrera  Neuron 
Volume 45, Issue 4, Pages (February 2005)
Lior Shmuelof, Ehud Zohary  Neuron 
Voxel-based Morphometric Analysis
Anatomical Measures John Ashburner
A Higher Order Motion Region in Human Inferior Parietal Lobule
Volume 63, Issue 5, Pages (September 2009)
Uri Hasson, Orit Furman, Dav Clark, Yadin Dudai, Lila Davachi  Neuron 
Integration of Local Features into Global Shapes
Active Appearance Models theory, extensions & cases
Volume 34, Issue 1, Pages (March 2002)
Volume 16, Issue 15, Pages (August 2006)
Common Prefrontal Regions Coactivate with Dissociable Posterior Regions during Controlled Semantic and Phonological Tasks  Brian T Gold, Randy L Buckner 
Presentation transcript:

Mindboggle: A scatterbrained approach to automate brain labeling arno klein  arno@paperwaspstudio.com Cornell University, fMRI Research Center, Columbia University

Unlabeled brain image data Morphometric data fMRI BOLD data

Manually labeled structural data Morphometric data fMRI BOLD data

Manually labeled activity data Talairach Atlas fMRI BOLD data Corresponding subject slices

Unlabeled brains

Atlases (manually labeled brains)

The correspondence problem Atlas Subject ?

Standard approaches Methods Examples Linear registration: Talairach-type spaces Piece-wise linear registration: Talairach (original) Warping with landmarks: Thin-plate splines Unsupervised warping: SPM, AIR, ANIMAL Feature matching: Watershed basins, parametric curves/surfaces

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Extract pieces Skeletonize each slice of segmented non-white matter (only step in 2-D). Split the resulting sulcus skeleton into left and right hemispheres. 2-D pieces in adjacent slices are grouped to make 3-D pieces.

Extract pieces Skeletonize each slice of segmented non-white matter (only step in 2-D). Split the resulting sulcus skeleton into left and right hemispheres. 2-D pieces in adjacent slices are grouped to make 3-D pieces.

Extract pieces Skeletonize each slice of segmented non-white matter (only step in 2-D). Split the resulting sulcus skeleton into left and right hemispheres. 2-D pieces in adjacent slices are grouped to make 3-D pieces.

Extract pieces One sulcus piece: Divide the resulting 3-D sulcus pieces along vertical bifurcations. Fragment into smaller clusters with a k-means algorithm. Recombine pairs of fragments if they share extensive borders.

Extract pieces Divide the resulting 3-D sulcus pieces along vertical bifurcations. Fragment into smaller clusters with a k-means algorithm. Recombine pairs of fragments if they share extensive borders.

27 initial means (bounding box) Extract pieces 27 initial means (bounding box) Divide the resulting 3-D sulcus pieces along vertical bifurcations. Fragment into smaller clusters with a k-means algorithm. Recombine pairs of fragments if they share extensive borders.

Extract pieces Divide the resulting 3-D sulcus pieces along vertical bifurcations. Fragment into smaller clusters with a k-means algorithm. Recombine pairs of fragments if they share extensive borders.

Extract pieces Divide the resulting 3-D sulcus pieces along vertical bifurcations. Fragment into smaller clusters with a k-means algorithm. Recombine pairs of fragments if they share extensive borders.

Extract pieces

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Match pieces Atlas Subject ? ?

Match pieces Atlas pieces Subject pieces (grouped by sulci) (matches) Order matches by a cost function: Cost = wNN + wVV + wPP + wOO N = Δ # voxels P = Δ mean position V = Δ # subvolumes O = non-overlap

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Transform boundaries Atlas pieces Label boundaries (grouped by sulci) (grouped by sulci) Each atlas piece is paired with a patch of nearest label boundary points.

Transform boundaries label boundary patch for a given matching atlas piece is transformed to matching subject pieces Translate atlas label boundaries to the subject brain, patch by patch. Translation: mean (subject pieces) - mean (matching atlas piece).

Transform boundaries Atlas boundaries Subject (grouped by sulci)

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Warp labels precentral gyrus postcentral gyrus P’ P Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels precentral gyrus postcentral gyrus P’ P’ P Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels precentral gyrus postcentral gyrus P’ P’ Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Pi(t) = Pi(t-1) + h(P,t) |Pi’-Pi(t-1)| Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels precentral gyrus postcentral gyrus Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Pi(t) = Pi(t-1) + h(P,t) |Pi’-Pi(t-1)| Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels precentral gyrus postcentral gyrus Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels precentral gyrus postcentral gyrus Select a pair of points (P, P’) in the original and transformed atlas patch. Find the nearest neighborhood of voxels to point P in the original atlas space. Warp the neighborhood of labels to coat transformed atlas boundaries (≈SOM). Fill the subject gray matter mask with new neighborhood majority atlas labels.

Warp labels

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Label agreement metrics: Evaluation automated labels A overlap manual labels M ► ◄ Label agreement metrics: Va = intersection with the same label = Vc = comparison volume .e = filled intersection = Va / intersection of atlas and subject = filled maskoverlap = Va / interiiunion of atlas and subject = fill ed mask overlap = Va / union of atlas and subject = filled mask overlap ? ∑|Ai∩Mi| ∑|A ∩Mi| = = ∑|Ai∩Mi| ∑|AiUMi| = ∑|Ai∩Mi| ∑|Mi|

Evaluation ► ◄ Error metrics: Type IIerror (A,M) = ∑[|A∩Mi| - |Ai∩Mi|] automated labels A overlap manual labels M ► ◄ Error metrics: = Type IIerror (A,M) = ∑[|A∩Mi| - |Ai∩Mi|] ∑|Mi| When incorrect labels are assigned to a region (e.g. voxels in the superior frontal gyrus are labeled as middle frontal gyrus). Type II error (A,M) = 1 - ∑|Ai∩Mi| ∑|Ai| When a region's label is assigned to other regions (e.g. voxels outside of superior frontal gyrus are labeled as superior frontal gyrus).

Evaluation * A one-way ANOVA was performed to test if the means are the same for the label agreements obtained by each of the methods. A multiple comparison test was then performed to determine which pair of means are significantly different (95% confidence interval around the mean, based on the Studentized range distribution). Mindboggle obtained a significantly higher mean filled mask label agreement than did linear registration or SPM2 (p < 0.05).

Evaluation The atlas was used to label an artificially lesioned version of itself.

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

A single atlas Atlas Subject ?

Multiple atlases Subject ?

Number of labels per voxel Multiple atlases Number of labels per voxel

Number of labels per voxel: voxel counts Multiple atlases Number of labels per voxel: voxel counts

Mindboggle Extract pieces Match pieces Transform boundaries Warp labels Evaluate Use multiple atlases Evaluate

Errors: automated labels ≠ manual labels Evaluation Errors: automated labels ≠ manual labels

Percent label agreement by subject, number of atlases Evaluation Percent label agreement by subject, number of atlases

Change in percent label agreement by subject group, number of atlases Evaluation Change in percent label agreement by subject group, number of atlases

ANOVA, multiple comparison Evaluation ANOVA, multiple comparison

Evaluation Percent label agreement by number of labels per voxel, number of atlases

Conclusions Mindboggle: Fully automated Feature-based (vs. intensity-based registration) Does not assume that different brains preserve topography Robust to reduced and nonuniform image quality Competitive with standard techniques Performs just as well when parts of brain are removed Labels may be transferred to any regions of interest (e.g. structures or activity data) Multiple atlases provide independent label sets, confidence measures, higher accuracy

Future directions http://www.arnoklein.net/mindboggle.html More information may be found on the website: http://www.arnoklein.net/mindboggle.html and in two publications: one under review at NeuroImage outlining and evaluation Mindboggle, and the second concerning multiple atlases will be submitted to BioMed Central Medicine (www.biomedcentral.com). The software will undergo beta-testing in the Hirsch lab for a few months before being released.

Acknowledgments Columbia University Joy Hirsch fMRI Research Center Columbia University Brett Mensh New York State Psychiatric Institute Satrajit Ghosh, Jason Tourville: Cognitive and Neural Systems Boston University Frank Guenther, PI; supported by NIH grant R01 DC02852 Jack Grinband Columbia University Thesis committee members Keith Purpura, Norman Relkin, and Jonathon Victor.

Single atlas variance

Functional mapping tests The resulting labels may be transferred to a coregistered volume of activity data. Mindboggle labeled activity from 5 subjects undergoing 4 standard tasks that are known to elicit activity in specific regions (Hirsch, 2000). We determined whether Mindboggle’s labels included those regions. According to Mindboggle, of the 45 gyrii expected to be activated (9 gyrii distributed across 4 tasks performed by 5 subjects), 44 were activated, well within expected variance of the subject pool.

Flowchart