Multimodal Surface Matching: Fast and Generalisable Cortical Registration Using Discrete Optimisation
Group neuroimaging studies of the cerebral cortex benefit from accurate, surface-based, cross-subject alignment for investigating brain architecture, function and connectivity. There is an increasing amount of high quality data available. However, establishing how different modalities correlate across groups remains an open research question. One reason for this is that the current methods for registration, based on cortical folding, provide sub-optimal alignment of some functional sub-regions of the brain. A more flexible framework is needed that will allow robust alignment of multiple modalities. We adapt the Fast Primal-Dual (Fast-PD) approach for discrete Markov Random Field (MRF) optimisation to spherical registration by reframing the deformation labels as a discrete set of rotations and propose a novel regularisation term, derived from the geodesic distance between rotation matrices. This formulation allows significant flexibility in the choice of similarity metric. To this end we propose a new multivariate cost function based on the discretisation of a graph-based mutual information measure. Results are presented for alignment driven by scalar metrics of curvature and myelination, and multivariate features derived from functional task performance. These experiments demonstrate the potential of this approach for improving the integration of complementary brain data sets in the future.
KeywordsMarkov Random Field Geodesic Distance Rotation Matrice Surface Registration Multivariate Feature
Unable to display preview. Download preview PDF.
- 4.Petrović, A., Smith, S.M., Menke, R.A., Jenkinson, M.: Methods for tractography-driven surface registration of brain structures. In: Yang, G.-Z., Hawkes, D., Rueckert, D., Noble, A., Taylor, C. (eds.) MICCAI 2009, Part I. LNCS, vol. 5761, pp. 705–712. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 8.Heinrich, M.P., Jenkinson, M., Brady, M., Schnabel, J.A.: Globally optimal deformable registration on a minimum spanning tree using dense displacement sampling. In: Ayache, N., Delingette, H., Golland, P., Mori, K. (eds.) MICCAI 2012, Part III. LNCS, vol. 7512, pp. 115–122. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 10.Neemuchwala, H.F.: Entropic graphs for image registration. PhD thesis, University of Michigan (2005)Google Scholar
- 14.Komodakis, N., Tziritas, G.: Approximate labeling via graph cuts based on linear programming. PAMI 29(8) (2007)Google Scholar