Optimizing a medical image registration algorithm based on profiling data for real-time performance

• Tipo: Artigo em Revista Científica Internacional
• Data: 2021-01

Autores

Carlos A. S. J. Gulo (Autor) Outra; Antonio C. Sementille (Autor) Outra; João Manuel R. S. Tavares (Autor) FEUP

Revista

Título: Multimedia Tools and Applications

Vol. 81 Nº 2

Páginas: 2603-2620

ISSN: 1380-7501

Editora: Springer Nature

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 0 Citações

Classificação Científica

CORDIS: Ciências Tecnológicas

FOS: Ciências médicas e da saúde

Outras Informações

ID Authenticus: P-00V-MY6

DOI: 10.1007/s11042-021-11699-x

Abstract (EN): Image registration is a commonly task in medical image analysis. Therefore, a significant number of algorithms have been developed to perform rigid and non-rigid image registration. Particularly, the free-form deformation algorithm is frequently used to carry out non-rigid registration task; however, it is a computationally very intensive algorithm. In this work, we describe an approach based on profiling data to identify potential parts of this algorithm for which parallel implementations can be developed. The proposed approach assesses the efficient of the algorithm by applying performance analysis techniques commonly available in traditional computer operating systems. Hence, this article provides guidelines to support researchers working on medical image processing and analysis to achieve real-time non-rigid image registration applications using common computing systems. According to our experimental findings, significant speedups can be accomplished by parallelizing sequential snippets, i.e., code regions that are executed more than once. For the selected costly functions previously identified in the studied free-form deformation algorithm, the developed parallelization decreased the runtime by up to seven times relatively to the related single thread based implementation. The implementations were developed based on the Open Multi-Processing application programming interface. In conclusion, this study confirms that based on the call graph visualization and detected performance bottlenecks, one can easily find and evaluate snippets which are potential optimization targets in addition to throughput in memory accesses.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 18