Quantitative Susceptibility Mapping (QSM) Algorithms: Mathematical Rationale and Computational Implementations

Quantitative susceptibility mapping (QSM) solves the magnetic field-to-magnetization (tissue susceptibility) inverse problem under conditions of noisy and incomplete field data acquired using magnetic resonance imaging. Therefore, sophisticated algorithms are necessary to treat the ill-posed nature of the problem and are reviewed here. The forward problem is typically presented as an integral form, where the field is the convolution of the dipole kernel and tissue susceptibility distribution. This integral form can be equivalently written as a partial differential equation (PDE). Algorithmic challenges are to reduce streaking and shadow artifacts characterized by the fundamental solution of the PDE. Bayesian maximum a posteriori estimation can be employed to solve the inverse problem, where morphological and relevant biomedical knowledge (specific to the imaging situation) are used as priors. As the cost functions in Bayesian QSM framework are typically convex, solutions can be robustly computed using a gradient-based optimization algorithm. Moreover, one can not only accelerate Bayesian QSM, but also increase its effectiveness at reducing shadows using prior knowledge based preconditioners. Improving the efficiency of QSM is under active development, and a rigorous analysis of preconditioning needs to be carried out for further investigation.