Detalhes do Documento

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

Autor(es): Gulo, Carlos A. S. J. ; Sementille, Antonio C. [UNESP] ; Tavares, João Manuel R. S.

Data: 2022

Identificador Persistente: http://hdl.handle.net/11449/222782

Origem: Oasisbr

Assunto(s): Medical image processing and analysis; Non-rigid image registration; Performance analysis; Profiling tools


Descrição

Made available in DSpace on 2022-04-28T19:46:39Z (GMT). No. of bitstreams: 0 Previous issue date: 2022-01-01

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

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.

CNPq National Scientific and Technological Development Council Research Group PIXEL - UNEMAT

Programa Doutoral em Engenharia Informática Instituto de Ciência e Inovação em Engenharia Mecânica e Engenharia Industrial Faculdade de Engenharia Universidade do Porto

Departamento de Ciências da Computação Faculdade de Ciências Universidade Estadual Paulista-UNESP

Instituto de Ciência e Inovação em Engenharia Mecânica e Engenharia Industrial Departamento de Engenharia Mecânica Faculdade de Engenharia Universidade do Porto

Departamento de Ciências da Computação Faculdade de Ciências Universidade Estadual Paulista-UNESP

Tipo de Documento Artigo científico
Idioma Inglês
facebook logo  linkedin logo  twitter logo 
mendeley logo

Documentos Relacionados