Fast quantitative susceptibility mapping with L1-regularization and automatic parameter selection

Purpose To enable fast reconstruction of quantitative susceptibility maps with total variation penalty and automatic regularization parameter selection. Methods ℓ[subscript 1]-Regularized susceptibility mapping is accelerated by variable splitting, which allows closed-form evaluation of each iterati...

Full description

Bibliographic Details
Main Authors: Bilgic, Berkin (Author), Fan, Audrey P. (Contributor), Polimeni, Jonathan R. (Author), Cauley, Stephen F. (Author), Bianciardi, Marta (Author), Adalsteinsson, Elfar (Contributor), Setsompop, Kawin (Author), Wald, Lawrence (Contributor)
Other Authors: Harvard University- (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Wiley Blackwell, 2015-11-03T18:22:03Z.
Subjects:
Online Access:Get fulltext
LEADER 02768 am a22002893u 4500
001 99688
042 |a dc 
100 1 0 |a Bilgic, Berkin  |e author 
100 1 0 |a Harvard University-  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Fan, Audrey P.  |e contributor 
100 1 0 |a Adalsteinsson, Elfar  |e contributor 
100 1 0 |a Wald, Lawrence  |e contributor 
700 1 0 |a Fan, Audrey P.  |e author 
700 1 0 |a Polimeni, Jonathan R.  |e author 
700 1 0 |a Cauley, Stephen F.  |e author 
700 1 0 |a Bianciardi, Marta  |e author 
700 1 0 |a Adalsteinsson, Elfar  |e author 
700 1 0 |a Setsompop, Kawin  |e author 
700 1 0 |a Wald, Lawrence  |e author 
245 0 0 |a Fast quantitative susceptibility mapping with L1-regularization and automatic parameter selection 
260 |b Wiley Blackwell,   |c 2015-11-03T18:22:03Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/99688 
520 |a Purpose To enable fast reconstruction of quantitative susceptibility maps with total variation penalty and automatic regularization parameter selection. Methods ℓ[subscript 1]-Regularized susceptibility mapping is accelerated by variable splitting, which allows closed-form evaluation of each iteration of the algorithm by soft thresholding and fast Fourier transforms. This fast algorithm also renders automatic regularization parameter estimation practical. A weighting mask derived from the magnitude signal can be incorporated to allow edge-aware regularization. Results Compared with the nonlinear conjugate gradient (CG) solver, the proposed method is 20 times faster. A complete pipeline including Laplacian phase unwrapping, background phase removal with SHARP filtering, and ℓ[subscript 1]-regularized dipole inversion at 0.6 mm isotropic resolution is completed in 1.2 min using MATLAB on a standard workstation compared with 22 min using the CG solver. This fast reconstruction allows estimation of regularization parameters with the L-curve method in 13 min, which would have taken 4 h with the CG algorithm. The proposed method also permits magnitude-weighted regularization, which prevents smoothing across edges identified on the magnitude signal. This more complicated optimization problem is solved 5 times faster than the nonlinear CG approach. Utility of the proposed method is also demonstrated in functional blood oxygen level-dependent susceptibility mapping, where processing of the massive time series dataset would otherwise be prohibitive with the CG solver. Conclusion Online reconstruction of regularized susceptibility maps may become feasible with the proposed dipole inversion. 
546 |a en_US 
655 7 |a Article 
773 |t Magnetic Resonance in Medicine