A comparison of optimization algorithms for localized in vivo B0 shimming

23Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Purpose: To compare several different optimization algorithms currently used for localized in vivo B0 shimming, and to introduce a novel, fast, and robust constrained regularized algorithm (ConsTru) for this purpose. Methods: Ten different optimization algorithms (including samples from both generic and dedicated least-squares solvers, and a novel constrained regularized inversion method) were implemented and compared for shimming in five different shimming volumes on 66 in vivo data sets from both 7 T and 9.4 T. The best algorithm was chosen to perform single-voxel spectroscopy at 9.4 T in the frontal cortex of the brain on 10 volunteers. Results: The results of the performance tests proved that the shimming algorithm is prone to unstable solutions if it depends on the value of a starting point, and is not regularized to handle ill-conditioned problems. The ConsTru algorithm proved to be the most robust, fast, and efficient algorithm among all of the chosen algorithms. It enabled acquisition of spectra of reproducible high quality in the frontal cortex at 9.4 T. Conclusions: For localized in vivo B0 shimming, the use of a dedicated linear least-squares solver instead of a generic nonlinear one is highly recommended. Among all of the linear solvers, the constrained regularized method (ConsTru) was found to be both fast and most robust. Magn Reson Med 79:1145–1156, 2018. © 2017 International Society for Magnetic Resonance in Medicine.

Cite

CITATION STYLE

APA

Nassirpour, S., Chang, P., Fillmer, A., & Henning, A. (2018). A comparison of optimization algorithms for localized in vivo B0 shimming. Magnetic Resonance in Medicine, 79(2), 1145–1156. https://doi.org/10.1002/mrm.26758

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free