Orzada, Stephan; Akash, Safi; Fiedler, Thomas M.; Kratzer, Fabian J.; Ladd (M.), Mark E.:
An investigation into the dependence of virtual observation point‐based specific absorption rate calculation complexity on number of channels
In: Magnetic Resonance in Medicine, Vol. 89 (2023), No. 1, pp. 469 - 476
2023article/chapter in journalOA Hybrid
MedicineScientific institutes » Erwin L. Hahn Institute for Magnetic Resonance Imaging (ELH)
Related: 1 publication(s)
Title in English:
An investigation into the dependence of virtual observation point‐based specific absorption rate calculation complexity on number of channels
Author:
Orzada, StephanUDE
LSF ID
58645
ORCID
0000-0001-9784-4354ORCID iD
Other
connected with university
corresponding author
;
Akash, Safi;Fiedler, Thomas M.
ORCID
0000-0002-1556-375XORCID iD
;
Kratzer, Fabian J.
ORCID
0000-0001-7454-1641ORCID iD
;
Ladd (M.), Mark E.UDE
LSF ID
29716
Other
connected with university
Year of publication:
2023
Open Access?:
OA Hybrid
Web of Science ID
PubMed ID
Scopus ID
Language of text:
English
Keyword, Topic:
computational burden ; MRI ; SAR ; VOP compression

Abstract in English:

Purpose This study aims to find a relation between the number of channels and the computational burden for specific absorption rate (SAR) calculation using virtual observation point-based SAR compression. Methods Eleven different arrays of rectangular loops covering a cylinder of fixed size around the head of an anatomically correct voxel model were simulated. The resulting Q-matrices were compressed with 2 different compression algorithms, with the overestimation fixed to a certain fraction of worst-case SAR, median SAR, or minimum SAR. The latter 2 were calculated from 1e6 normalized random excitation vectors. Results The number of virtual observation points increased with the number of channels to the power of 2.3-3.7, depending on the compression algorithm when holding the relative error fixed. Together with the increase in the size of the Q-matrices (and therefore the size of the virtual observation points), the total increase in computational burden with the number of channels was to the power of 4.3-5.7. Conclusion The computational cost emphasizes the need to use the best possible compression algorithms when moving to high channel counts.