Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4965073 | Computers in Biology and Medicine | 2016 | 11 Pages |
Abstract
Quantitative susceptibility mapping (QSM) reconstruction is a well-known ill-posed problem. Various regularization techniques have been proposed for solving this problem. In this paper, a rapid method is proposed that uses â0 norm minimization in a gradient domain. Because â0 minimization is an NP-hard problem, a special alternating optimization strategy is employed to simplify the reconstruction algorithm. The proposed algorithm uses only simple point-wise multiplications and thresholding operations, and significantly speeds up the calculation. Both numerical simulations and in vivo experiments demonstrate that the proposed method can reconstruct susceptibility fast and accurately. Because morphology information weighted methods have achieved considerable success in QSM, we performed a quantitative comparison with some typical weighted methods, such as MEDI (morphology enabled dipole inversion), iLSQR (improved least squares algorithm), and wâ1 (weighted â1 norm minimization). The reconstructed results show that the proposed method can provide accurate results with a satisfactory speed.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Congbo Cai, Xi Chen, Weijun Liu, Shuhui Cai, Delu Zeng, Xinghao Ding,