Large-scale analysis of neuroimaging data on commercial clouds with content-aware resource allocation strategies

被引:5
作者
Minervini, Massimo [1 ]
Rusu, Cristian [1 ]
Damiano, Mario [2 ]
Tucci, Valter [3 ]
Bifone, Angelo [2 ]
Gozzi, Alessandro [2 ]
Tsaftaris, Sotirios A. [1 ,4 ]
机构
[1] IMT Inst Adv Studies, I-55100 Lucca, Italy
[2] Ist Italiano Tecnol, Ctr Neurosci & Cognit Syst, Rovereto, Italy
[3] Ist Italiano Tecnol, Neurosci & Brain Technol Dept, Genoa, Italy
[4] Northwestern Univ, Dept Elect Engn & Comp Sci, Evanston, IL 60208 USA
关键词
High-performance computing; cloud; neuroimaging; MRI; phenotyping; computer vision; image analysis; resource allocation; machine learning; SEGMENTATION; IMAGE;
D O I
10.1177/1094342013519483
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The combined use of mice that have genetic mutations (transgenic mouse models) of human pathology and advanced neuroimaging methods (such as magnetic resonance imaging) has the potential to radically change how we approach disease understanding, diagnosis and treatment. Morphological changes occurring in the brain of transgenic animals as a result of the interaction between environment and genotype can be assessed using advanced image analysis methods, an effort described as mouse brain phenotyping'. However, the computational methods involved in the analysis of high-resolution brain images are demanding. While running such analysis on local clusters is possible, not all users have access to such infrastructure and even for those that do, having additional computational capacity can be beneficial (e.g. to meet sudden high throughput demands). In this paper we use a commercial cloud platform for brain neuroimaging and analysis. We achieve a registration-based multi-atlas, multi-template anatomical segmentation, normally a lengthy-in-time effort, within a few hours. Naturally, performing such analyses on the cloud entails a monetary cost, and it is worthwhile identifying strategies that can allocate resources intelligently. In our context a critical aspect is the identification of how long each job will take. We propose a method that estimates the complexity of an image-processing task, a registration, using statistical moments and shape descriptors of the image content. We use this information to learn and predict the completion time of a registration. The proposed approach is easy to deploy, and could serve as an alternative for laboratories that may require instant access to large high-performance-computing infrastructures. To facilitate adoption from the community we publicly release the source code.
引用
收藏
页码:473 / 488
页数:16
相关论文
共 41 条
[1]  
Albers R., 2009, Parallel Distributed Processing, P1
[2]   Backward-optimized orthogonal matching pursuit approach [J].
Andrle, M ;
Rebollo-Neira, L ;
Sagianos, E .
IEEE SIGNAL PROCESSING LETTERS, 2004, 11 (09) :705-708
[3]  
[Anonymous], 2010, 2010 IEEE 3 INT C CL
[4]  
[Anonymous], 1998, JOB SCHEDULING STRAT
[5]  
Antoniu G, 2010, AZUREBRAIN LARGE SCA
[6]   Symmetric diffeomorphic image registration with cross-correlation: Evaluating automated labeling of elderly and neurodegenerative brain [J].
Avants, B. B. ;
Epstein, C. L. ;
Grossman, M. ;
Gee, J. C. .
MEDICAL IMAGE ANALYSIS, 2008, 12 (01) :26-41
[7]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[8]   An easy measure of compactness for 2D and 3D shapes [J].
Bribiesca, Ernesto .
PATTERN RECOGNITION, 2008, 41 (02) :543-554
[9]  
Buyya R, 2004, GECON 2004, P19
[10]  
Buyya R, 2009, LECT NOTES COMPUT SC, V5931, P24, DOI 10.1007/978-3-642-10665-1_4