Fast magnetic susceptibility reconstruction using L0 norm of gradient

There is a growing interest in quantifying tissue susceptibility in MRI. However, the zeros in the dipole kernel makes the calculation of the magnetic susceptibility from the measured field to be an ill-posed problem. Recently, Bayesian regularization approaches have been utilized to enable accurate quantitative susceptibility mapping(QSM), such as L2 norm gradient minimization and TV. In this work, we propose an efficient QSM method by using a sparsity promoting regularization which called L0 norm of gradient to reconstruct susceptibility map. The use of L0 norm allows us to yield high quality image and prevent penalizing salient edges. Since the L0 minimization is an NP-hard problem, a special alternating optimization strategy by introducing an auxiliary variable is adopted to solve the problem and it only takes 1-2 mins to reconstruct the whole 3D susceptibility data. Both numerical phantom simulations and human brain tests are performed to demonstrate the superior performance of the proposed method compared with previous methods.

[1]  J W Langston,et al.  The correlation between phase shifts in gradient-echo MR images and regional brain iron concentration. , 1999, Magnetic resonance imaging.

[2]  Pascal Spincemaille,et al.  Nonlinear Regularization for Per Voxel Estimation of Magnetic Susceptibility Distributions From MRI Field Maps , 2010, IEEE Transactions on Medical Imaging.

[3]  Ferdinand Schweser,et al.  Quantitative susceptibility mapping for investigating subtle susceptibility variations in the human brain , 2012, NeuroImage.

[4]  D. L. Donoho,et al.  Compressed sensing , 2006, IEEE Trans. Inf. Theory.

[5]  XuYi,et al.  Image smoothing via L0 gradient minimization , 2011 .

[6]  R. Cusack,et al.  New Robust 3-D Phase Unwrapping Algorithms: Application to Magnetic Field Mapping and Undistorting Echoplanar Images , 2002, NeuroImage.

[7]  Yi Wang,et al.  Morphology enabled dipole inversion for quantitative susceptibility mapping using structural consistency between the magnitude image and the susceptibility map , 2012, NeuroImage.

[8]  ProblemsPer Christian HansenDepartment The L-curve and its use in the numerical treatment of inverse problems , 2000 .

[9]  Lawrence L. Wald,et al.  Fast quantitative susceptibility mapping with L1‐regularization and automatic parameter selection , 2013, Magnetic resonance in medicine.

[10]  N. Yamada,et al.  Intracranial calcification on gradient-echo phase image: depiction of diamagnetic susceptibility. , 1996, Radiology.

[11]  Yi Wang,et al.  Background field removal by solving the Laplacian boundary value problem , 2014, NMR in biomedicine.

[12]  Yi Wang,et al.  Calculation of susceptibility through multiple orientation sampling (COSMOS): A method for conditioning the inverse problem from measured magnetic field map to susceptibility source image in MRI , 2009, Magnetic resonance in medicine.

[13]  R. Bowtell,et al.  Susceptibility mapping in the human brain using threshold‐based k‐space division , 2010, Magnetic resonance in medicine.

[14]  Yi Wang,et al.  Quantitative susceptibility map reconstruction from MR phase data using bayesian regularization: Validation and application to brain imaging , 2010, Magnetic resonance in medicine.

[15]  C. Moonen,et al.  A fast calculation method for magnetic field inhomogeneity due to an arbitrary distribution of bulk susceptibility , 2003 .

[16]  Weiyu Xu,et al.  Accuracy of the Morphology Enabled Dipole Inversion (MEDI) Algorithm for Quantitative Susceptibility Mapping in MRI , 2012, IEEE Transactions on Medical Imaging.

[17]  D. Donoho For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[18]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .