Parallelized Calculation of the T2 Relaxation Time in MRI

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F14%3APU109583" target="_blank" >RIV/00216305:26220/14:PU109583 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/7296359" target="_blank" >https://ieeexplore.ieee.org/document/7296359</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TSP.2015.7296359" target="_blank" >10.1109/TSP.2015.7296359</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallelized Calculation of the T2 Relaxation Time in MRI

Popis výsledku v původním jazyce

This paper presents the computation of relaxation time T2 measured with the Spin Echo method. The tomograph provides a signal in which the important factor is the location of the peaks from individual measurements. These points must be interleaved with an exponential function. The described process has to be repeated for each pixel of the sensed tissue, and this requirement makes the processing of larger images very time-consuming. Assuming the resolution of 256x256, 20 slices, and 5 measurements with different times TE, it is necessary to reconstruct 1.3x10^6 exponential functions, which requires the processing of more than 6 MB of data. At present, such computation lasts approximately 3 minutes if performed by means of a regular PC. The author discusses various approaches to the parallelization of the given problem. In the described context, the time required for the processing was shortened to 300 ms.

Název v anglickém jazyce

Parallelized Calculation of the T2 Relaxation Time in MRI

Popis výsledku anglicky

This paper presents the computation of relaxation time T2 measured with the Spin Echo method. The tomograph provides a signal in which the important factor is the location of the peaks from individual measurements. These points must be interleaved with an exponential function. The described process has to be repeated for each pixel of the sensed tissue, and this requirement makes the processing of larger images very time-consuming. Assuming the resolution of 256x256, 20 slices, and 5 measurements with different times TE, it is necessary to reconstruct 1.3x10^6 exponential functions, which requires the processing of more than 6 MB of data. At present, such computation lasts approximately 3 minutes if performed by means of a regular PC. The author discusses various approaches to the parallelization of the given problem. In the described context, the time required for the processing was shortened to 300 ms.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

37th International Conference on Telecommunications and Signal Processing (TSP)

ISBN

978-80-214-4983-1

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

725-728

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

Prague, Czech Republic

Datum konání akce

9. 7. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000375231000250