Abstract | ||
---|---|---|
This paper introduces an efficient algorithm for magnetic resonance (MR) image reconstruction. The proposed method minimizes a linear combination of nonlocal total variation, least square data fitting term and wavelet sparsity terms to reconstruct the MR image from undersampled k-space data. The nonlocal total variation and wavelet sparsity are taken as the hybrid L1-regularization functional and solving it using a Split Bregman algorithm. The proposed algorithm is compared with previous methods in terms of the reconstruction accuracy and computational complexity. The comparison results demonstrate the superiority of the proposed algorithm for compressed MR image reconstruction. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.sigpro.2013.11.001 | Signal Processing |
Keywords | Field | DocType |
MR image reconstruction,Nonlocal total variation,Compressed sensing,Split Bregman algorithm | Least squares,Iterative reconstruction,Linear combination,Mathematical optimization,Curve fitting,Pattern recognition,Regularization (mathematics),Artificial intelligence,Mathematics,Compressed sensing,Wavelet,Computational complexity theory | Journal |
Volume | ISSN | Citations |
103 | 0165-1684 | 3 |
PageRank | References | Authors |
0.47 | 25 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Varun P. Gopi | 1 | 16 | 7.79 |
P. Palanisamy | 2 | 11 | 2.97 |
Khan A. Wahid | 3 | 327 | 38.08 |
Paul Babyn | 4 | 166 | 21.42 |
David Cooper | 5 | 15 | 1.87 |