Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 1 de 1
Filtrar
Más filtros

Banco de datos
Tipo del documento
Revista
Asunto de la revista
País de afiliación
Intervalo de año de publicación
1.
MAGMA ; 34(2): 297-307, 2021 Apr.
Artículo en Inglés | MEDLINE | ID: mdl-32601881

RESUMEN

Dynamic MRI is useful to diagnose different diseases, e.g. cardiac ailments, by monitoring the structure and function of the heart and blood flow through the valves. Faster data acquisition is highly desirable in dynamic MRI, but this may lead to aliasing artifacts due to under-sampling. Advanced image reconstruction algorithms are required to obtain aliasing-free MR images from the acquired under-sampled data. One major limitation of using the advanced reconstruction algorithms is their computationally expensive and time-consuming nature, which make them infeasible for clinical use, especially for applications like cardiac MRI. L + S decomposition model is an approach provided in literature which separates the sparse and low-rank information in dynamic MRI. However, L + S decomposition model is a computationally complex process demanding significant computation time. In this paper, a parallel framework is proposed to accelerate the image reconstruction process of L + S decomposition model using GPU. Experiments are performed on cardiac perfusion dataset ([Formula: see text]) and cardiac cine dataset ([Formula: see text]) using NVIDIA's GeForce GTX780 GPU and Core-i7 CPU. The results show that the proposed method provides up to 18 × speed-up including the memory transfer time (i.e. data transfer between the CPU and GPU) and ~ 46 × speed-up without memory transfer for the cardiac perfusion dataset in our experiments. This level of improvement in the reconstruction time will increase the usefulness of L + S reconstruction by making it feasible for clinical applications.


Asunto(s)
Imagen por Resonancia Magnética , Algoritmos , Artefactos , Corazón , Procesamiento de Imagen Asistido por Computador
SELECCIÓN DE REFERENCIAS
DETALLE DE LA BÚSQUEDA