Signal Model and Encoding Operators
A reconstruction needs a model of how the measured k-space data arises from the image. This page describes the signal model of MRIReco.jl, its discretization into the encoding operator and the operators that evaluate it for different trajectories, for several coils and with relaxation and off-resonance. Reconstruction as an Inverse Problem explains how a reconstruction uses this operator.
The Signal Model
MRIReco.jl uses the signal model of equation (2) in the MRIReco.jl paper, written here with the symbols of the tutorials. The demodulated signal that coil
where
The Encoding Operator
The signal is sampled at the times
so the samples of all coils, stacked into the vector
MRIReco.jl never stores *, their adjoint is adjoint(E), and ∘ combines them, which is how MRIOperators builds
Fourier Encoding
Without the correction map and the coil sensitivities,
For Cartesian trajectories, the samples lie on a grid, and the operator is an FFT,
FFTOp. If only some of the grid points were measured, aSamplingOpkeeps the measured samples.For non-Cartesian trajectories, such as radial and spiral ones, the operator is a non-uniform FFT,
NFFTOp, computed by NFFT.jl. The NFFT approximates the sum with an FFT on a grid that is finer than the image grid by the oversampling factor σ and a convolution with a small window. The parameters:oversamplingFactorand:kernelSizeof the iterative reconstructions, with the defaults 1.25 and 3, set σ and the size of the window, and with them the balance between accuracy and speed. The direct reconstruction and reconstructions with a correction map always use the defaults.
MRIOperators also provides ExplicitOp, which evaluates the sum directly, including the correction map. It is exact, but its cost grows with the number of samples times the number of voxels. The reconstruction therefore uses the fast operators. ExplicitOp mainly serves for simulations with :simulation = "explicit" and as a reference for testing the fast operators. For an odd number of voxels along an axis, it currently puts the center of the image half a voxel away from where the fast operators put it (#375).
Coil Sensitivities
With several receive coils, the image is first multiplied by the sensitivities of all coils, which SensitivityOp does, and the image of each coil is then Fourier encoded:
where DiagOp, which applies
Relaxation and Off-Resonance
The factor FieldmapNFFTOp therefore approximates it by a sum of
which turns the operator into a weighted sum of :method of the iterative reconstructions chooses how the coefficients are computed. The default "nfft" approximates the exponential analytically and determines "leastsquare" fit the coefficients for :K sets, to the correction map. Section 2.2 of the paper gives references for these approximations.
The iterative reconstructions take the correction map from the parameter :correctionMap. They count the times from the field TE of the trajectory and so reconstruct the magnetization at that time. For the built-in trajectories and custom ones without times, this is the time of the first sample of a readout, so for readouts that start at the edge of k-space, such as Cartesian lines and full radial spokes, it comes before the echo. Correct Off-Resonance shows how to pass a field map and which sampling times the correction needs.
The Normal Operator and the Toeplitz Approach
Iterative solvers such as CGNR apply the normal operator normalOperator, which can use a faster implementation than applying NFFTOp, the normal operator is a convolution of the image with a kernel that depends only on the trajectory and the weights. With :toeplitz = true, MRIReco.jl computes this convolution with two FFTs on a grid of twice the image size in each dimension, so that the window convolutions of the NFFT are no longer needed in the iterations. Section 3.2 of the paper compares both approaches for a radial dataset: they were similarly fast for fully sampled data, while for fourfold undersampled data, the NFFT with σ = 1.25 was clearly faster, because its FFTs are smaller and fewer samples have to be gridded.