Local SAR constrained Hotspot Reduction by Temporal Averaging


Journal article


I. Graesslin, C. Steiding, J. Weller, S. Biederer, D. Brunner, H. Homann, F. Schweser, U. Katscher, K. Pruessmann, P. Boernert
2009

Semantic Scholar
Cite

Cite

APA   Click to copy
Graesslin, I., Steiding, C., Weller, J., Biederer, S., Brunner, D., Homann, H., … Boernert, P. (2009). Local SAR constrained Hotspot Reduction by Temporal Averaging.


Chicago/Turabian   Click to copy
Graesslin, I., C. Steiding, J. Weller, S. Biederer, D. Brunner, H. Homann, F. Schweser, U. Katscher, K. Pruessmann, and P. Boernert. “Local SAR Constrained Hotspot Reduction by Temporal Averaging” (2009).


MLA   Click to copy
Graesslin, I., et al. Local SAR Constrained Hotspot Reduction by Temporal Averaging. 2009.


BibTeX   Click to copy

@article{i2009a,
  title = {Local SAR constrained Hotspot Reduction by Temporal Averaging},
  year = {2009},
  author = {Graesslin, I. and Steiding, C. and Weller, J. and Biederer, S. and Brunner, D. and Homann, H. and Schweser, F. and Katscher, U. and Pruessmann, K. and Boernert, P.}
}

Abstract

gation, the sequence is partitioned into L different sections, and for each section, different excitation pulses bn l (1≤l≤L) are used. As input for the subsequent optimization of the temporal averaging, different pulses are selected with desired target magnetization patterns ml as similar as possible, however, with different critical hotspot locations. The optimal time partitioning for the pulses bn is given by dividing the total scan time T into L time intervals tj (j=1…L) so that minimal maximum SAR values are obtained. Time intervals were calculated according to the non-linear optimization problem max{Sx} = min subject to xj≥0 and ∑jxj=1. xj equals to the non-linear optimization problem max{ST/tj} = min. S contains the SAR values of all body cells in the columns for each pulse bnl. This problem is solved using a generic optimizer [10]. A real-time SAR calculation according to [11] was used. The experiments were carried out on an eight-channel transmit 3T MRI system [12] (based on Achieva, Philips Healthcare, The Netherlands). In a first step, L=8 different 2D Transmit SENSE RF pulses [13], transmitting very similar target patterns, were calculated using the above described algorithm (32×32 FOX pixel, reduction factor R=7, spiral k-space trajectory). In a second step, also some pulses with a higher deviation from the target pattern were used according to Fig. 1. Results and Discussion The individual spatial SAR distributions for the different RF pulses that were calculated iteratively using the algorithm above are shown in Fig. 4. The SAR of the initial RF pulse and the results of the local SAR reduction by temporal averaging are shown in Fig. 3. It was possible to reduce the limiting SAR hotspot in the torso region up to 55%, while meeting the SAR limits [14] in all other regions. A further reduction was achieved by using RF pulses with different excitation quality up to additional 25%. The use of the Lanczos algorithm enabled the calculation of the RF pulses within a few seconds making this iterative optimization procedure feasible. Conclusion A recently proposed temporal averaging approach, exploiting the temporal degree of freedom of multishot imaging sequences, was extended using an SOCP based minimization technique incorporating local SAR constraints. Thus it is being able to reduce local SAR hotspots iteratively. Further SAR reduction was achieved by using pulses of different excitation quality.





Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in