Knowledge-driven deep learning for fast MR imaging: Undersampled MR image reconstruction from supervised to un-supervised learning

Deep learning (DL) has emerged as a leading approach in accelerating MRI. It employs deep neural networks to extract knowledge from available datasets and then applies the trained networks to reconstruct accurate images from limited measurements. Unlike natural image restoration problems, MRI involves physics-based imaging processes, unique data properties, and diverse imaging tasks. This domain knowledge needs to be integrated with data-driven approaches. Our review will introduce the significant challenges faced by such knowledge-driven DL approaches in the context of fast MRI along with several notable solutions, which include learning neural networks and addressing different imaging application scenarios. The traits and trends of these techniques have also been given which have shifted from supervised learning to semi-supervised learning, and finally, to unsupervised learning methods. In addition, MR vendors' choices of DL reconstruction have been provided along with some discussions on open questions and future directions, which are critical for the reliable imaging systems.

Accelerated Musculoskeletal Magnetic Resonance Imaging

With a substantial growth in the use of musculoskeletal MRI, there has been a growing need to improve MRI workflow, and faster imaging has been suggested as one of the solutions for a more efficient examination process. Consequently, there have been considerable advances in accelerated MRI scanning methods. This article aims to review the basic principles and applications of accelerated musculoskeletal MRI techniques including widely used conventional acceleration methods, more advanced deep learning-based techniques, and new approaches to reduce scan time. Specifically, conventional accelerated MRI techniques, including parallel imaging, compressed sensing, and simultaneous multislice imaging, and deep learning-based accelerated MRI techniques, including undersampled MR image reconstruction, super-resolution imaging, artifact correction, and generation of unacquired contrast images, are discussed. Finally, new approaches to reduce scan time, including synthetic MRI, novel sequences, and new coil setups and designs, are also reviewed. We believe that a deep understanding of these fast MRI techniques and proper use of combined acceleration methods will synergistically improve scan time and MRI workflow in daily practice. EVIDENCE LEVEL: 3 TECHNICAL EFFICACY: Stage 1.

Multicomponent MR fingerprinting reconstruction using joint-sparsity and low-rank constraints

PURPOSE

To develop an efficient algorithm for multicomponent MR fingerprinting (MC-MRF) reconstructions directly from highly undersampled data without making prior assumptions about tissue relaxation times and expected number of tissues.

METHODS

The proposed method reconstructs MC-MRF maps from highly undersampled data by iteratively applying a joint-sparsity constraint to the estimated tissue components. Intermediate component maps are obtained by a low-rank multicomponent alternating direction method of multipliers (MC-ADMM) including the non-negativity of tissue weights as an extra regularization term. Over iterations, the used dictionary compression is adjusted. The proposed method (k-SPIJN) is compared with a two-step approach in which image reconstruction and multicomponent estimations are performed sequentially and tested in numerical simulations and in vivo by applying different undersampling factors in eight healthy volunteers. In the latter case, fully sampled data serves as the reference.

RESULTS

The proposed method shows improved precision and accuracy in simulations compared with a state-of-art sequential approach. Obtained in vivo magnetization fraction maps for different tissue types show reduced systematic errors and reduced noise-like effects. Root mean square errors in estimated magnetization fraction maps significantly reduce from 13.0% <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:semantics><mml:mrow><mml:mo>±</mml:mo></mml:mrow> <mml:annotation>$$ \pm $$</mml:annotation></mml:semantics> </mml:math> 5.8% with the conventional, two-step approach to 9.6% <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:semantics><mml:mrow><mml:mo>±</mml:mo></mml:mrow> <mml:annotation>$$ \pm $$</mml:annotation></mml:semantics> </mml:math> 3.9% and 9.6% <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:semantics><mml:mrow><mml:mo>±</mml:mo></mml:mrow> <mml:annotation>$$ \pm $$</mml:annotation></mml:semantics> </mml:math> 3.2% with the proposed MC-ADMM and k-SPIJN methods, respectively. Mean standard deviation in homogeneous white matter regions reduced significantly from 8.6% to 2.9% (two step vs. k-SPIJN).

CONCLUSION

The proposed MC-ADMM and k-SPIJN reconstruction methods estimate MC-MRF maps from highly undersampled data resulting in improved image quality compared with the existing method.