+ All Categories
Home > Documents > Evaluation Methods for Diffusion-driven ParcellationAnalysis and Machine Intelligence, vol. 26, no....

Evaluation Methods for Diffusion-driven ParcellationAnalysis and Machine Intelligence, vol. 26, no....

Date post: 01-Aug-2020
Category:
Upload: others
View: 0 times
Download: 0 times
Share this document with a friend
1
Evaluation Methods for Diffusion-driven Parcellation Sarah Parisot Daniel Rueckert Biomedical Image Analysis Group, Department of Computing, Imperial College London, UK Introduction Context I Brain connectivity studies can provide key insight into the brain’s organisation I Parcellation of the cortical surface is essential for the construction of connectivity networks I Parcellation evaluation is very challenging due to the absence of ground truth Highlights I Two quantitative brain parcellation evaluation measures I Evaluate group consistency and fidelity to the connectivity matrix I Tested on 5 different methods I Measures follow what is expected intuitively Database Data I 50 different subjects of the Human Connectome Project database [1] I Cortical surfaces represented as 32k vertices meshes I Sulcal mesh registration yields vertex correspondences across subjects Tractography matrix I Obtained from FSL’s bedpostX and probtrackX [2] I A row of the matrix describes how a vertex is connected to the rest of the cortical surface: Connectivity profile I Affinity between vertices: Pearsons’ correlation between connectivity profiles Parcellation methods I Connectivity independent I Connectivity driven: regroup vertices with a high affinity Information Loss: Kullback-Leibler Divergence Connectivity Matrix Merging After Parcellation I Assign a merged connectivity profile to each parcel by averaging the parcels’ vertices’ connectivity profiles I For N vertices and K parcels: Tractography matrix N x N x 1 x 2 x 3 x 4 Parcellation Reverting to original space X m X m Merged Tractography matrix K x K Merged Tractography matrix N x N X m X m X m Kullback-Leibler Divergence I Evaluate the information loss caused by approximating the tractography matrix χ with the merged matrix χ m reverted to the original N × N space. I Compute the KL divergence between χ and χ m , normalised to be probability mass functions. I The KL divergence should be minimal when the parcellation is the most faithful to the data Group Consistency: Sum of Absolute Differences I Inspired from the Minimum Description Length concept I Single-subject parcellations matching based on the number of shared vertices I Compute a group average merged tractography matrix I Compute the SAD between each subject’s merged tractography matrix and the average I Evaluates how close the group is to the average representation I Compares network similarity rather than parcel boundaries Results Compared methods Connectivity independent: I Anatomical parcellations (Destrieux atlas [5]) I Poisson disk sampling random parcellations Tractography driven: I Hierarchical clustering I Multi-scale spectral clustering I Group-wise multi-scale spectral clustering Anatomical Random Hierarchical Spectral Groupwise Quantitative results I Boxplot comparison of all methods: I Evolution of the two measures with respect to the number of parcels: Acknowledgements The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 319456. Data were provided by the Human Connectome Project, WU-Minn Consortium (Principal Investigators: David Van Essen and Kamil Ugurbil; 1U54MH091657) funded by the 16 NIH Institutes and Centers that support the NIH Blueprint for Neuroscience Research; and by the McDonnell Center for Systems Neuroscience at Washington University. References [1] Glasser, M.F. (2013): The minimal preprocessing pipelines for the human connectome project. NeuroImage, vol. 80, pp. 105-124 [2] Behrens, T. (2007): Probabilistic diffusion tractography with multiple fibre orientations: What can we gain? NeuroImage, vol. 34, no. 1, pp. 144-155 [3] Peyre, G. (2004): Surface segmentation using geodesic centroidal tesselation. In: 3DPVT. pp. 995-002. IEEE Computer Society [4] Yu, S.X. (2004).: Segmentation given partial grouping constraints. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 173-183 [5] Destrieux, C., (2010): Automatic parcellation of human cortical gyri and sulci using standard anatomical nomenclature. NeuroImage, vol. 53, no 1, pp. 1-15 [email protected]
Transcript
Page 1: Evaluation Methods for Diffusion-driven ParcellationAnalysis and Machine Intelligence, vol. 26, no. 2, pp. 173-183 [5]Destrieux, C., (2010): Automatic parcellation of human cortical

Evaluation Methods for Diffusion-drivenParcellation

Sarah Parisot Daniel RueckertBiomedical Image Analysis Group, Department of Computing, Imperial College

London, UK

Introduction

ContextI Brain connectivity studies can provide key insight into

the brain’s organisation

I Parcellation of the cortical surface is essential for theconstruction of connectivity networks

I Parcellation evaluation is very challenging due to theabsence of ground truth

HighlightsI Two quantitative brain parcellation evaluation measures

I Evaluate group consistency and fidelity to theconnectivity matrix

I Tested on 5 different methods

I Measures follow what is expected intuitively

Database

DataI 50 different subjects of the Human Connectome Project

database [1]

I Cortical surfaces represented as 32k vertices meshes

I Sulcal mesh registration yields vertex correspondencesacross subjects

Tractography matrixI Obtained from FSL’s bedpostX and probtrackX [2]

I A row of the matrix describes how a vertex is connectedto the rest of the cortical surface: Connectivity profile

I Affinity between vertices: Pearsons’ correlation betweenconnectivity profiles

Parcellation methodsI Connectivity independent

I Connectivity driven: regroup vertices with a high affinity

Information Loss: Kullback-Leibler Divergence

Connectivity Matrix Merging After ParcellationI Assign a merged connectivity profile to each parcel by averaging the parcels’

vertices’ connectivity profiles

I For N vertices and K parcels:

Tractography

matrix

N x N

x1 x2

x3 x4Parcellation Reverting to

original space

Xm

Xm

Merged

Tractography

matrix

K x K

Merged

Tractography

matrix

N x N

Xm

Xm Xm

Kullback-Leibler DivergenceI Evaluate the information loss caused by approximating the tractography matrix χ

with the merged matrix χm reverted to the original N ×N space.

I Compute the KL divergence between χ and χm, normalised to be probabilitymass functions.

I The KL divergence should be minimal when the parcellation is the most faithful tothe data

Group Consistency: Sum of Absolute Differences

I Inspired from the Minimum Description Length concept

I Single-subject parcellations matching based on the number of shared vertices

I Compute a group average merged tractography matrix

I Compute the SAD between each subject’s merged tractography matrix and theaverage

I Evaluates how close the group is to the average representation

I Compares network similarity rather than parcel boundaries

Results

Compared methodsConnectivity independent:

I Anatomical parcellations (Destrieux atlas [5])

I Poisson disk sampling random parcellations

Tractography driven:

I Hierarchical clustering

I Multi-scale spectral clustering

I Group-wise multi-scale spectral clustering

Anatomical Random

Hierarchical Spectral Groupwise

Quantitative results

I Boxplot comparison of all methods:

I Evolution of the two measures with respect to the number of parcels:

Acknowledgements

The research leading to these results has received funding from the European Research Councilunder the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC GrantAgreement no. 319456. Data were provided by the Human Connectome Project, WU-MinnConsortium (Principal Investigators: David Van Essen and Kamil Ugurbil; 1U54MH091657) fundedby the 16 NIH Institutes and Centers that support the NIH Blueprint for Neuroscience Research;and by the McDonnell Center for Systems Neuroscience at Washington University.

References

[1] Glasser, M.F. (2013): The minimal preprocessing pipelines for the human connectome project.NeuroImage, vol. 80, pp. 105-124

[2] Behrens, T. (2007): Probabilistic diffusion tractography with multiple fibre orientations: What canwe gain? NeuroImage, vol. 34, no. 1, pp. 144-155

[3] Peyre, G. (2004): Surface segmentation using geodesic centroidal tesselation. In: 3DPVT. pp.995-002. IEEE Computer Society

[4] Yu, S.X. (2004).: Segmentation given partial grouping constraints. IEEE Transactions on PatternAnalysis and Machine Intelligence, vol. 26, no. 2, pp. 173-183

[5] Destrieux, C., (2010): Automatic parcellation of human cortical gyri and sulci using standardanatomical nomenclature. NeuroImage, vol. 53, no 1, pp. 1-15

[email protected]

Recommended