Extended phase graph
≈ 10 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In magnetic resonance imaging and nuclear magnetic resonance the extended phase graph (EPG) is a mathematical framework used to track how magnetization evolves in a voxel through a series of radiofrequency (RF) pulses and gradients. While traditional Bloch simulations track individual spins in the spatial domain, EPG operates in the Fourier domain. The magnetization vectors along one dimension of a voxel are stored as Fourier coefficients. Each Fourier coefficient represents the weighting of a helix that twists along one dimension of the voxel with an integer number of twists. Performing a weighted sum of all the helices gives the magnetization vectors in the spatial domain. In this representation, a gradient along one dimension of the voxel that causes an integer number of twists simply shifts the index of each Fourier coefficient by that integer, making EPG very computationally efficient at modeling sequences with many RF pulses and gradients. EPG was first proposed by Jürgen Hennig to model multiecho sequences and is now used to model magnetic resonance fingerprinting, turbo spin echos, and other sequences.
In magnetic resonance imaging and nuclear magnetic resonance the extended phase graph (EPG) is a mathematical framework used to track how magnetization evolves in a voxel through a series of radiofrequency (RF) pulses and gradients. While traditional Bloch simulations track individual spins in the spatial domain, EPG operates in the Fourier domain. The magnetization vectors along one dimension of a voxel are stored as Fourier coefficients. Each Fourier coefficient represents the weighting of a helix that twists along one dimension of the voxel with an integer number of twists. Performing a weighted sum of all the helices gives the magnetization vectors in the spatial domain. In this representation, a gradient along one dimension of the voxel that causes an integer number of twists simply shifts the index of each Fourier coefficient by that integer, making EPG very computationally efficient at modeling sequences with many RF pulses and gradients. EPG was first proposed by Jürgen Hennig to model multiecho sequences and is now used to model magnetic resonance fingerprinting, turbo spin echos, and other sequences. In the Bloch equations, within a voxel each spin along the dimension z can be described by a magnetization vector [M_x(z), M_y(z), M_z(z)]^T where every element is real valued. But M_x(z) and M_y(z) can also be described by the complex number M_+(z)=M_x(z)+iM_y(z) . Using a similarity matrix S we can convert between the real valued basis and the complex transverse magnetization basis: \begin{align} &S=\begin{bmatrix} 1 & i & 0 \\ 1 & -i & 0 \\ 0 & 0 & 1\end{bmatrix}, &\mathbf{m}(z)=\begin{bmatrix} M_+(z) \\ M_-(z) \\ M_z(z) \end{bmatrix}=S \begin{bmatrix} M_x(z) \\ M_y(z) \\ M_z(z) \end{bmatrix}\\ \end{align} where M_- is the complex conjugate of M_+ . To perform a rotation on the complex magnetization vector \mathbf{m} due to an RF pulse with angle \alpha and phase \phi , we first apply a change of basis with S^{-1} , then apply standard cartesian rotation matrices R_z(\phi) , R_x(\alpha) , then another change of basis with S : \begin{align} &R_z(\phi)=\begin{bmatrix} \cos \phi & -\sin \phi & 0 \\ \sin \phi & \cos \phi & 0 \\ 0 & 0 & 1\end{bmatrix},\;\;R_x(\alpha)=\begin{bmatrix} 1 & 0 & 0 \\ 0 & \cos \alpha & -\sin \alpha \\ 0 & \sin \alpha & \cos \alpha \end{bmatrix}\\ &\\ &T_\phi (\alpha)=SR_z(\phi)R_x(\alpha)R_z(-\phi)S^{-1}\\ &\\ &T_\phi (\alpha)=\begin{bmatrix} \cos^2 \frac{\alpha}{2} & e^{2i\phi}\sin^2 \frac{\alpha}{2} & -e^{i\phi}\sin \alpha \\ e^{-2i\phi} \sin^2 \frac{\alpha}{2} & \cos^2 \frac{\alpha}{2} & ie^{-i\phi} \sin \alpha\\ -\frac{i}{2}e^{-i\phi} \sin \alpha & \frac{i}{2}e^{i\phi} \sin \alpha & \cos \alpha \end{bmatrix}\\ &\\ &\mathbf{m}^+(z)=T_\phi (\alpha)\mathbf{m}(z) \end{align} Where \mathbf{m}^+ denotes the magnetization vector after the rotation. In the EPG representation we perform a Fourier decomposition of each element of the complex magnetization vector: \begin{align} &M_+(z)=\sum_{k=-\infty}^{\infty} F_+(k)e^{i2\pi kz} \; \Leftrightarrow \; F_+(k)=\int_{-0.5}^{0.5} M_+(z)e^{-i2\pi kz}dz\\ &M_-(z)=\sum_{k=-\infty}^{\infty} F_-(k)e^{i2\pi kz} \; \Leftrightarrow \; F_-(k)=\int_{-0.5}^{0.5} M_-(z)e^{-i2\pi kz}dz\\ &M_z(z)=\sum_{k=-\infty}^{\infty} Z(k)e^{i2\pi kz} \; \Leftrightarrow \; Z(k)=\int_{-0.5}^{0.5} M_z(z)e^{-i2\pi kz}dz\\ \end{align} If F_+(k)=0 , F_-(k)=0 , and Z(k)=0 when k>n or k . We can write the summations as being from k=-n to n . We can also write the Fourier coefficients as a vector valued function: \begin{align} &\mathbf{f}(k)=\begin{bmatrix} F_+(k) \\ F_-(k) \\ Z(k) \end{bmatrix}, &\mathbf{m}(z)=\sum_{k=-n}^{n} \mathbf{f}(k)e^{i2\pi kz} \\ \end{align}
RF pulses
When performing a rotation, because T_\phi (\alpha) is constant across k it can enter the sum: \begin{align} &\mathbf{m}^+(z)=T_\phi (\alpha)\mathbf{m}(z)=\sum_k T_\phi (\alpha)\mathbf{f}(k)e^{i2\pi kz}\\ &\mathbf{f}^+(k)=T_\phi (\alpha)\mathbf{f}(k) \end{align} It can be seen in the equation above that the rotation matrix can be applied directly to the Fourier coefficients to produce updated Fourier coefficients.
Gradients
A gradient in the z dimension that creates one twist from z=-0.5 to z=0.5 can be applied with the matrix: \begin{align} &T(z)=SR_z(2\pi z)S^{-1}=\begin{bmatrix} e^{i2\pi z} & 0 & 0\\ 0 & e^{-i2\pi z} & 0\\ 0 & 0 & 1 \end{bmatrix}\\ \end{align} This matrix is independent of k so it can enter the Fourier sum: \begin{align} &\mathbf{m}^+(z)=T(z)\mathbf{m}(z)= T(z)\sum_k \mathbf{f}(k)e^{i2\pi kz}=\sum_k T(z)\mathbf{f}(k)e^{i2\pi kz}\\ \end{align} Looking at each element of \mathbf{m}^+ : \begin{align} &M_+^+(z)=\sum_k e^{i2\pi z}F_+(k)e^{i2\pi kz}=\sum_k F_+(k)e^{i2\pi(k+1)z}\\ &M_-^+(z)=\sum_k e^{-i2\pi z}F_-(k)e^{i2\pi kz}=\sum_k F_-(k)e^{i2\pi(k-1)z}\\ &M_z^+(z)=M_z(z)\\ \end{align} Performing a substitution with \hat{k}=k+1 for the first element we get: \begin{align} &M_+^+(z)=\sum_{\hat{k}=-n+1}^{n+1} F_+(\hat{k}-1)e^{i2\pi \hat{k} z}\\ \end{align} If F_+(n)=0 and F_+(-n-1)=0 the above summation is equal to: \begin{align} &M_+^+(z)=\sum_{\hat{k}=-n}^{n} F_+(\hat{k}-1)e^{i2\pi \hat{k} z}\\ \end{align} and it can be seen that F_+^+(k)=F_+(k-1) . By the same logic F_-^+(k)=F_-(k+1) . So gradients in the EPG formalism simply shift the indices of the Fourier coefficients.
Relaxation
The relaxation and recovery matrices given by the Bloch equations for a real valued magnetization vector \mathbf{v} are: \begin{align} &E=\begin{bmatrix} e^{-t/T2} & 0 & 0 \\ 0 & e^{-t/T2} & 0\\ 0 & 0 & e^{-t/T1}\end{bmatrix}, &\mathbf{r}=\begin{bmatrix} 0\\ 0\\ M_0(1-e^{-t/T1}) \end{bmatrix}\\ &\\ &\mathbf{v}^+=E\mathbf{v}+\mathbf{r} \end{align} Substituting with \mathbf{v}=S^{-1}\mathbf{m} : \begin{align} &S^{-1}\mathbf{m}^{+}=ES^{-1}\mathbf{m}+\mathbf{r}\\ &\mathbf{m}^{+}=SES^{-1}\mathbf{m}+S\mathbf{r} \end{align} S and E are commutative so SES^{-1}=ESS^{-1}=E . Also S\mathbf{r}=\mathbf{r} , so: \begin{align} &\mathbf{m}^{+}(z)=E\mathbf{m}(z)+\mathbf{r}=E \sum_k \mathbf{f}(k)e^{i2\pi kz}+\mathbf{r}=\sum_k E\mathbf{f}(k)e^{i2\pi kz}+\mathbf{r}\\ \end{align} \mathbf{r} is a constant vector but we can still Fourier decompose it to \mathbf{r}(z)=\sum_k \mathbf{g}(k)e^{i2\pi kz} where \mathbf{g}(k)=\mathbf{r} if \mathbf{k}=0 else \mathbf{g}(k)=\mathbf{0} , so: \begin{align} &\mathbf{m}^{+}(z)=\sum_k E\mathbf{f}(k)e^{i2\pi kz}+\sum_k \mathbf{g}(k)e^{i2\pi kz}=\sum_k (E\mathbf{f}(k)+\mathbf{g}(k))e^{i2\pi kz}\\ \end{align} So it can be seen that to apply a relaxation, you can multiply every Fourier coefficient with the relaxation matrix E and then add the recovery vector \mathbf{r} to the 0th coefficient.
Total signal in voxel
The total transverse signal in the voxel is obtained by integrating over M_+(z) : \begin{align} &M_{+total}=\int_{-0.5}^{0.5} \sum_{k=-n}^{n} F_+(k)e^{i2\pi kz}\;dz=\sum_{k=-n}^{n} (F_+(k)\int_{-0.5}^{0.5}e^{i2\pi kz}dz)=\sum_{k=-n}^{n} F_+(k)\frac{1}{i2\pi k}(e^{i\pi k}-e^{-i\pi k})\\ \end{align} so when k is nonzero, F_+(k) is multiplied by zero and doesn't end up in the sum. If k=0 the inner integral is 1. So the total transverse signal in the voxel is just F_+(0) . By the same logic the total longitudinal signal is Z(0) .
Coefficient redundancy
It can be proven that F_+(k)=F_-(-k)^* : \begin{align} &F_-(k)=\int M_+(z)^*e^{-i2\pi kz}dz\\ &F_-(-k)=\int M_+(z)^*e^{i2\pi kz}dz=\int (M_+(z)e^{-i2\pi kz})^*dz=F_+(k)^*\\ \end{align} and so in practice only coefficients with k\ge 0 are stored and if a gradient occurs that would shift a coefficient to having a negative index, instead that coefficient is conjugated and stored at a non-negative index.
Computation
In practice, a discrete number of Fourier coefficients are tracked. A matrix can be set up with n+1 frequencies tracked like so: \begin{bmatrix} F_+(0) & F_+(1) & ... & F_+(n)\\ F_-(0) & F_-(1) & ... & F_-(n)\\ Z(0) & Z(1) & ... & Z(n)\\ \end{bmatrix} This matrix can be multiplied by the RF pulse rotation matrix T_\phi (\alpha) , or multiplied by the relaxation matrix E and then have \textbf{r} added to the first column, to update the coefficients. A gradient that adds one twist along the z dimension will result in the first row being shifted right by one, and the second row being shifted left. Then F_+(0) can be set to F_-(0)^* .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1377921154 under CC BY-SA 4.0; modifications have been made.