Name
Abstract | ||
|---|---|---|
Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the issue. In this work, we unroll the iterations of the primal-dual hybrid gradient algorithm to a learnable deep network architecture, and gradually relax the constraints to reconstruct MR images from highly undersampled k-space data. The proposed method combines the theoretical convergence guarantee of optimization methods with the powerful learning capability of deep networks. As the constraints are gradually relaxed, the reconstruction model is finally learned from the training data by updating in k-space and image domain alternatively. Experiments on in vivo MR data demonstrate that the proposed method achieves superior MR reconstructions from highly undersampled k-space data over other state-of-the-art image reconstruction methods. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-32248-9_3 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
MR reconstruction,Primal dual,Deep learning | Conference | 11766 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Cheng | 1 | 50 | 14.53 |
| Haifeng Wang | 2 | 21 | 5.87 |
| Leslie Ying | 3 | 240 | 29.08 |
| Dong Liang | 4 | 131 | 14.36 |