Computing the shape of brain networks using graph filtration and Gromov-Hausdorff metric

N/ACitations
Citations of this article
88Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The difference between networks has been often assessed by the difference of global topological measures such as the clustering coefficient, degree distribution and modularity. In this paper, we introduce a new framework for measuring the network difference using the Gromov-Hausdorff (GH) distance, which is often used in shape analysis. In order to apply the GH distance, we define the shape of the brain network by piecing together the patches of locally connected nearest neighbors using the graph filtration. The shape of the network is then transformed to an algebraic form called the single linkage matrix. The single linkage matrix is subsequently used in measuring network differences using the GH distance. As an illustration, we apply the proposed framework to compare the FDG-PET based functional brain networks out of 24 attention deficit hyperactivity disorder (ADHD) children, 26 autism spectrum disorder (ASD) children and 11 pediatric control subjects. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lee, H., Chung, M. K., Kang, H., Kim, B. N., & Lee, D. S. (2011). Computing the shape of brain networks using graph filtration and Gromov-Hausdorff metric. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6892 LNCS, pp. 302–309). https://doi.org/10.1007/978-3-642-23629-7_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free