Computational Analysis of LDDMM for Brain Mapping

• Main Authors: Can eCeritoglu, Xiaoying eTang, Margaret eChow, Darian eHadjiabadi, Damish eShah, Timothy eBrown, Muhammad H. Burhanullah, Huong eTrinh, John eHsu, Katarina A. Ament, Deana eCrocetti, Susumu eMori, Stewart H Mostofsky, Steven eYantis, Michael I Miller, J Tilak eRatnanather
• Format: Article
• Language: English
• Published: Frontiers Media S.A. 2013-08-01
• Series: Frontiers in Neuroscience
• Subjects: Brain Mapping; computational anatomy; LDDMM; Subcortical segmentation; multiatlas segmentation
• Online Access: http://journal.frontiersin.org/Journal/10.3389/fnins.2013.00151/full

One goal of computational anatomy is to develop tools to accurately segment brain structures in healthy and diseased subjects. In this paper, we examine the performance and complexity of such segmentation in the framework of the large deformation diffeomorphic metric mapping (LDDMM) registration method with reference to atlases and parameters. First we report the application of a multi-atlas segmentation approach to define basal ganglia structures in healthy and diseased kids’ brains. The segmentation accuracy of the multi-atlas approach is compared with the single atlas LDDMM implementation and two state-of-the-art segmentation algorithms – Freesurfer and FSL – by computing the overlap errors between automatic and manual segmentations of the six basal ganglia nuclei in healthy subjects as well as subjects with diseases including ADHD and Autism. The high accuracy of multi-atlas segmentation is obtained at the cost of increasing the computational complexity because of the calculations necessary between the atlases and a subject. Second, we examine the effect of parameters on total LDDMM computation time and segmentation accuracy for basal ganglia structures. Single atlas LDDMM method is used to automatically segment the structures in a population of 16 subjects using different sets of parameters. The results show that a cascade approach and using fewer time steps can reduce computational complexity as much as five times while maintaining reliable segmentations.