Imperial College London
Alternate

ProfessorDanielRueckert

Faculty of Engineering, Department of Computing

Professor of Visual Information Processing
 
 
 
//

Contact

 

+44 (0)20 7594 8333d.rueckert Website

 
 
//

Location

 

568Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Ktena:2017:10.1016/j.neuroimage.2017.12.052,
author = {Ktena, SI and Parisot, S and Ferrante, E and Rajchl, M and Lee, M and Glocker, B and Rueckert, D},
doi = {10.1016/j.neuroimage.2017.12.052},
journal = {NeuroImage},
pages = {431--442},
title = {Metric learning with spectral graph convolutions on brain connectivity networks.},
url = {http://dx.doi.org/10.1016/j.neuroimage.2017.12.052},
volume = {169},
year = {2017}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Graph representations are often used to model structured data at an individual or population level and have numerous applications in pattern recognition problems. In the field of neuroscience, where such representations are commonly used to model structural or functional connectivity between a set of brain regions, graphs have proven to be of great importance. This is mainly due to the capability of revealing patterns related to brain development and disease, which were previously unknown. Evaluating similarity between these brain connectivity networks in a manner that accounts for the graph structure and is tailored for a particular application is, however, non-trivial. Most existing methods fail to accommodate the graph structure, discarding information that could be beneficial for further classification or regression analyses based on these similarities. We propose to learn a graph similarity metric using a siamese graph convolutional neural network (s-GCN) in a supervised setting. The proposed framework takes into consideration the graph structure for the evaluation of similarity between a pair of graphs, by employing spectral graph convolutions that allow the generalisation of traditional convolutions to irregular graphs and operates in the graph spectral domain. We apply the proposed model on two datasets: the challenging ABIDE database, which comprises functional MRI data of 403 patients with autism spectrum disorder (ASD) and 468 healthy controls aggregated from multiple acquisition sites, and a set of 2500 subjects from UK Biobank. We demonstrate the performance of the method for the tasks of classification between matching and non-matching graphs, as well as individual subject classification and manifold learning, showing that it leads to significantly improved results compared to traditional methods.
AU  - Ktena,SI
AU  - Parisot,S
AU  - Ferrante,E
AU  - Rajchl,M
AU  - Lee,M
AU  - Glocker,B
AU  - Rueckert,D
DO  - 10.1016/j.neuroimage.2017.12.052
EP  - 442
PY  - 2017///
SN  - 1053-8119
SP  - 431
TI  - Metric learning with spectral graph convolutions on brain connectivity networks.
T2  - NeuroImage
UR  - http://dx.doi.org/10.1016/j.neuroimage.2017.12.052
UR  - http://hdl.handle.net/10044/1/55600
VL  - 169
ER  -
Download