Local SAR compression algorithm with improved compression, speed, and flexibility
Stephan Orzada, Thomas M. Fiedler, Harald H. Quick, Mark E. Ladd
Abstract
PURPOSE: Local specific absorption rate (SAR) compression algorithms are essential for enabling online SAR monitoring in parallel transmission. A better compression resulting in a lower number of virtual observation points improves speed of SAR calculation for online supervision and pulse design. METHOD: An iterative expansion of an existing algorithm presented by Lee et al is proposed in this work. The original algorithm is used within a loop, making use of the virtual observation points from the previous iteration as the starting subvolume, while decreasing the overestimation with each iteration. This algorithm is evaluated on the SAR matrices of three different simulated arrays. RESULT: The number of virtual observation points is approximately halved with the new algorithm, while at the same time the compression time is reduced with speed-up factors of up to 2.5. CONCLUSION: The new algorithm improves the original algorithm in terms of compression rate and speed.