Felix Glang1, Alexander Loktyushin1, Kai Herz1,2, Hoai Nam Dang3, Anagha Deshmane1, Simon Weinmüller3, Arnd Doerfler3, Andreas Maier4, Bernhard Schölkopf5, Klaus Scheffler1,2, and Moritz Zaiss1,3
1High-field Magnetic Resonance Center, Max-Planck Institute for Biological Cybernetics, Tübingen, Germany, 2Department of Biomedical Magnetic Resonance, Eberhard Karls University Tübingen, Tübingen, Germany, 3Friedrich-Alexander Universität Erlangen-Nürnberg (FAU), Neuroradiology, University Clinic Erlangen, Erlangen, Germany, 4Pattern Recognition Lab, Friedrich-Alexander-University Erlangen-Nürnberg, Erlangen, Germany, 5Empirical Inference, Max-Planck Institute for Intelligent Systems, Tübingen, Germany
Synopsis
Recently,
MRzero has been proposed as a fully differentiable Bloch-equation-based MRI
sequence invention framework. In this work, the approach is extended by
parallel imaging capability, employing a CG SENSE reconstruction that allows optimizing
for non-Cartesian sampling trajectories simultaneously with other sequence
parameters like RF pulses and timings. The approach is tested herein by
simulations on an in silico brain phantom and is found to yield improved
reconstructions compared to regular Cartesian undersampling, and to
simultaneously find variable flip angle patterns that compensate for transient
signal induced blurring.
Introduction
Parallel
imaging (PI) is a central technique in MRI applications for achieving shorter
scan times. Despite the abundance of advanced methods and algorithms, a large
proportion of PI applications employ regular Cartesian undersampling and
reconstruction. However, more general non-Cartesian sampling trajectories promise
improved PI performance. Recently, the MRzero framework1 has been proposed for automated MR
sequence generation based on differentiable Bloch simulations and a supervised
learning approach. In the present work, MRzero is extended by PI capability and
first steps towards full sequence optimization including non-Cartesian k-space
trajectories for improved PI performance are presented.Methods
MRzero is a
fully differentiable Bloch-equation-based MR simulation that mirrors the
acquisition on a real MR scanner. By that, it allows for an analytic
derivative-driven non-linear optimization of sequence parameters like spatial
encoding gradients (2D), RF pulses and timing of sequence events. Details on
the MRzero implementation are given in1.
In the
original single-channel approach, image reconstruction was performed via the
adjoint of the encoding operator composed of the known k-space locations . To enable parallel imaging with arbitrary k-space
trajectories, we employ CG SENSE2 by forming the multi-channel image
encoding operator
$$\boldsymbol{E}_{(r,m),n} = B_{1,r}^-(\boldsymbol{x}_n) \exp(\text{i} \boldsymbol{k}_m \cdot \boldsymbol{x}_n)$$
with coil
sensitivities $$$B_{1,r}^-$$$ of the r-th
channel at voxel locations $$$\boldsymbol{x}_n$$$. A reconstructed image $$$\boldsymbol{m}_\text{reco}$$$ can then be
formed from the multi-coil k-space signal $$$\boldsymbol{s}_r$$$ by solving the
linear equation system $$$\boldsymbol{E}^H\boldsymbol{E} \boldsymbol{m}_\text{reco}=\boldsymbol{E}^H \boldsymbol{s}_r$$$ with the CG
algorithm. Expressing CG reconstruction as a function $$$\boldsymbol{m}_\text{reco}=f(\boldsymbol{s}_r)$$$ allows
formulating the optimization objective function for the sequence parameters $$$\Psi$$$ as
$$\Psi^*=\underset{\Psi}{\text{arg min}} ||\boldsymbol{m}_\text{target} - f(\text{SCANNER}(\Psi,\Phi)\boldsymbol{m}_0)||_2^2 + R(\Psi)$$
with the forward
simulation operator $$$\text{SCANNER}(\Psi,\Phi)$$$ as described in 1 and the desired target image $$$\boldsymbol{m}_\text{target}$$$. In this work, the regularization $$$R(\Psi)$$$ included
additional terms penalizing both high g-factors and the trajectory exceeding
k-space boundaries. Despite the iterative reconstruction represented by $$$f$$$, the loss function is still differentiable with
respect to the sequence parameters $$$\Psi$$$, which allows for efficient gradient descent
optimization as in the original MRzero approach.
As
target for the optimizations, simulated reconstruction of a fully sampled
Cartesian FLASH
sequence (matrix size 48x48, flip angle FA=5°, TR=8 ms) on a numerical brain phantom was
used. Realistic coil sensitivities for simulations were obtained from a 20ch Rx
head coil by performing a fully sampled phantom scan (Figure 1I).Results
Figure 1A
shows the target image simulated from a fully sampled Cartesian FLASH sequence
(Figure 1A). Cartesian undersampling of this trajectory (Figure 1B,C) leads to
reconstruction artifacts, which can be observed in the difference maps (Figure
1D,E).
Learned
free non-Cartesian trajectories can improve the reconstruction of undersampled
datasets: Figure 2 shows iterations of such an optimization for acceleration R=3,
starting with an initialization at random sampling locations close to k-space center, which spread
over iterations to finally cover the entire k-space (Figure 2C). This yields
increasingly better reconstructions (Figure 2A) with lower prediction error
(Figure 2B), converging to a solution with reconstruction error clearly below
the regularly undersampled Cartesian case (Figure 1B,D).
Next, the
potential of MRzero for full sequence parameter optimization was addressed. For
this, additionally, the FA of each RF excitation pulse were
initialized at zero and left as free optimization parameters. To make the
optimization task more difficult, for the target FLASH sequence, FA was
increased to 25° and TR to 20 ms, whereas for the optimization, TR was fixed at 8 ms.
This enforces learning a variable FA pattern to compensate for blurring induced
by transient signal decay. Figure 3A,B shows that for acceleration R=4 this learned sequence yields reconstruction
errors below 6%, again clearly below the
Cartesian undersampling case (Figure 1C,E). The learned variable FAs (Figure 3D)
show a plausible pattern of increasing FA over repetitions.Discussion
The
conducted simulation experiments showed that deviating from regular Cartesian
undersampling can provide better PI reconstructions. This is not surprising, as
incoherent undersampling spreads the aliasing artifact across the entire image,
which makes this a key ingredient of compressed sensing techniques4. Thus, extending the MRzero
reconstruction by such techniques or even deep learning reconstructions would
thus be a next logical step.
Recently,
there have been several works on learning-based non-Cartesian trajectory
optimization for both single-channel5,6 and PI acquisition7,8. Although MRzero cannot yet compete
with these approaches in terms of achievable resolution, it has the advantage of
a very general formulation of the MR acquisition. This enables not only
optimization of sampling trajectories, but also joint optimization of all
sequence parameters, like RF pulses and timings, and the reconstruction process
according to a target contrast of interest.
For
realistic application, as a next step, hardware limitations of the gradient
system, i.e. maximum gradient strengths and slew rates, need to be taken into
account, which can e.g. be formulated as additional penalty terms in the loss
function.Conclusion
Parallel
imaging was incorporated into the MRzero framework, enabling full supervised
optimization of sequence parameters, including non-Cartesian k-space
trajectories for multi-channel acquisitions and variable excitation flip angles. This offers the potential of
finding acquisition schemes that are better suited for parallel imaging than
conventional Cartesian undersampling. As this was shown herein for simulated
data only, next steps will focus on translating the results to a real MR
system.Acknowledgements
Financial support of the Max-Planck Society and ERC Advanced Grant "SpreadMRI", No 834940 is gratefully acknowledged.References
1.
Loktyushin A, Herz K, Dang N, et al. MRzero -- Fully automated invention of MRI
sequences using supervised learning. arXiv:2002.04265 [physics] 2020.
2.
Pruessmann KP, Weiger M, Börnert P, Boesiger P. Advances in sensitivity
encoding with arbitrary k-space trajectories. Magnetic Resonance in
Medicine 2001;46:638–651.
3.
Pruessmann KP, Weiger M, Scheidegger MB, Boesiger P. SENSE: Sensitivity
encoding for fast MRI. Magnetic Resonance in Medicine 1999;42:952–962.
4. Lustig M, Donoho D, Pauly JM. Sparse MRI: The application of compressed
sensing for rapid MR imaging. Magnetic Resonance in Medicine 2007;58:1182–1195.
5. Bahadir
CD, Dalca AV, Sabuncu MR. Learning-Based Optimization of the Under-Sampling
Pattern in MRI. Information Processing in Medical Imaging. Lecture Notes in Computer Science. Springer International Publishing; 2019. pp. 780–792.
6. Weiss T,
Senouf O, Vedula S, Michailovich O, Zibulevsky M, Bronstein A. PILOT:
Physics-Informed Learned Optimized Trajectories for Accelerated MRI.
arXiv:1909.05773 [physics] 2020.
7. Lazarus
C, Weiss P, Chauffert N, et al. SPARKLING: variable-density k-space filling
curves for accelerated T2*-weighted MRI. Magnetic Resonance in Medicine
2019;81:3643–3661.
8. Aggarwal
HK, Jacob M. J-MoDL: Joint Model-Based Deep Learning for Optimized Sampling and
Reconstruction. arXiv:1911.02945 [cs, eess] 2020.