Compensation of magnetic field inhomogeneity in MR spectroscopic imaging using dynamic k-space expansion in combination with parallel imaging
11221388 · 2022-01-11
Assignee
Inventors
Cpc classification
G01R33/5611
PHYSICS
A61B5/055
HUMAN NECESSITIES
G01R33/4818
PHYSICS
G01R33/485
PHYSICS
G01R33/56572
PHYSICS
International classification
G01R33/565
PHYSICS
A61B5/00
HUMAN NECESSITIES
Abstract
A method for the compensation of magnetic field inhomogeneity in magnetic resonance spectroscopic imaging comprising the steps of using dynamic k-space expansion in combination with parallel imaging.
Claims
1. A method for the compensation of magnetic field inhomogeneity in magnetic resonance spectroscopic imaging comprising the steps of using dynamic k-space expansion in combination with parallel imaging; said k-space is expanded with increasing spectral encoding time t, resulting in spectral line narrowing in proportion to the expansion of k-space; and minimizing gradient switching by tailoring the expansion and density of k-t-space sampling to the dispersion and density of signal trajectories in k-t-space.
2. The system and method of claim 1 wherein said expansion of the k-space with spectral encoding time includes interleaving progressively larger spatial encoding gradient moments.
3. The method of claim 1 wherein expanding the k-space is accomplished by extending high speed image encoding modules, including echo-planar and spiral encoding modules.
4. The method of claim 1 wherein said k-space is undersampled regularly and compressed sensing is used to reconstruct the missing data.
5. The method of claim 1 wherein said k-space is under sampled randomly and compressed sensing is used to reconstruct the missing data.
6. The method of claim 1 wherein said expansion of k-t-space is linear and employs readout gradient moment with stepwise increases (2G.sub.lδt) every second gradient using a constant gradient duration δ, up to the limits of the gradient performance.
7. The method of claim 1 wherein single-shot phase encoding using gradient blips with linearly increasing gradient moment G.sub.l*t are selectively interleaved into the readout, with a corresponding increase of the effective spectral dwell time.
8. The method of claim 7 wherein said interleaving starts at the edges of the original k.sub.y-k.sub.z-space and progressively inserts single-shot phase encoding into more central k.sub.y-k.sub.z-space encodings as time t increases.
9. The method of claim 1 wherein the k-space dimensions are tailored to the orientation and amplitude distribution of local Gradients G.sub.l based on B.sub.0 gradient maps.
10. The method of claim 1 further including the step of compensating local gradients in a selected brain region and simultaneously acquiring signals from the rest of the brain without compensation.
11. A method for the compensation of magnetic field inhomogeneity in magnetic resonance spectroscopic imaging comprising the steps of using dynamic k-space expansion in combination with parallel imaging; and said k-space is expanded with increasing spectral encoding time t, resulting in spectral line narrowing in proportion to the expansion of k-space; and wherein said k-space is undersampled regularly and partial parallel imaging is used to reconstruct the missing data.
12. A method for the compensation of magnetic field inhomogeneity in magnetic resonance spectroscopic imaging comprising the steps of using dynamic k-space expansion in combination with parallel imaging; and said k-space is expanded with increasing spectral encoding time t, resulting in spectral line narrowing in proportion to the expansion of k-space; and wherein said k-space is under sampled randomly and compressed sensing is used to reconstruct the missing data.
Description
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
(1) In the drawings, which are not necessarily drawn to scale, like numerals may describe substantially similar components throughout the several views. Like numerals having different letter suffixes may represent different instances of substantially similar components. The drawings illustrate generally, by way of example, but not by way of limitation, a detailed description of certain embodiments discussed in the present document.
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)
(32)
(33)
(34)
(35)
(36)
(37)
DETAILED DESCRIPTION OF THE INVENTION
(38) Detailed embodiments of the present invention are disclosed herein; however, it is to be understood that the disclosed embodiments are merely exemplary of the invention, which may be embodied in various forms. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a representative basis for teaching one skilled in the art to variously employ the present invention in virtually any appropriately detailed method, structure, or system. Further, the terms and phrases used herein are not intended to be limiting, but rather to provide an understandable description of the invention.
(39) Compensation of Local Gradients by Dynamic Case k-Space Expansion
(40) In one embodiment, the present invention provides for the global compensation of spectral line broadening in multiple regions with differing local gradient vectors. This may be accomplished by expanding the k-space with increasing spectral encoding time t, resulting in spectral line narrowing in proportion to the expansion of k-space. This k-space expansion approach does not increase spatial encoding time and it is more SNR efficient than approaches that increase spatial resolution.
(41) Increasing spatial resolution requires uniform expansion of k-space for all time slices, thus penalizing early time slices. However, expansion of k-space with spectral encoding time requires interleaving progressively stronger spatial encoding into the spectral acquisition and consequent elongation of the spectral dwell time, which decreases spectral bandwidth.
(42) The resulting undersampling, which increases with spectral encoding time is feasible, however, since spectral information density in k-t-space is typically sparse and decreases with increasing spectral encoding time. Spectral reconstruction of nonuniformly sampled data is performed by applying either non-uniform fast Fourier transform (NUFFT) regridding or expanded Fourier Transform, a MATLAB toolbox (https://www.mathworks.com/matlabcentral/fileexchange/11020-extended-dft). For example, the proton spectrum is quite sparse at long time delays and contains only a few peaks (water, Ino, Cho, Cr, NAA and perhaps lipids and lactate), which facilitates this approach. Spectral reconstruction of nonlinearly sampled data is well established using the non-linear Fourier Transform.
(43) This k-space expansion approach is compatible with conventional phase encoded MRSI and particularly suitable for high-speed MRSI, such as echo-planar MRSI and spiral MRSI. With echo-planar encoding, increasing the readout gradient moment with spectral encoding time expands kz and interleaving blipped phase encoding gradients (e.g. using single-shot interleaved phase encoding) expands k.sub.y and k.sub.z as shown in
(44) With spiral MRSI, expanding k-space can be accomplished by extending the spiral encoding module. More complex multi-axis gradient waveforms (e.g. to encode spherical trajectories) or combinations thereof, and switched nonlinear surface gradients, may also be particularly effective for dynamic k-space expansion. As gradient moments increase to encode the expanding k-space it becomes necessary to increase the spectral dwell time to accommodate the increasingly longer gradient encoding modules, leading to a decrease of the sampled spectral width, which must still fulfill the Nyquist criterion for sampling a minimum spectral width that fully resolves aliased spectral peaks.
(45) A preferred implementation that minimizes gradient switching tailors the expansion and density of k-t-space sampling to the dispersion and density of signal trajectories in k-t-space, which can be directly predicted from B.sub.0 mapping.
(46) Combining Gradient Encoding with Partial Parallel Imaging and Compressed Sensing
(47) The expansion of k-space may necessitate progressive k-space undersampling to maintain a desired maximum spectral dwell time. To relax the requirements of gradient encoding, in another embodiment, the present invention undersamples k-space either regularly or randomly, and uses partial parallel imaging or compressed sensing to reconstruct the missing data. The combination of high-speed MRSI with partial parallel imaging using GRAPPA and SENSE, and compressed sensing, has been introduced. In other aspects, the present invention samples the initial time slices without undersampling to enable computation of the reconstruction k-space kernel in case of GRAPPA or the sensitivity profiles for image space unfolding in case of SENSE. In still further aspects, the present invention is configured to increasingly undersample k-space with increasing spectral encoding time to maintain a desired maximum spectral dwell time.
(48) Dynamic K-Space Expansion in PEPSI Using Increasing Readout Gradient and Interleaved Phase Encoding Gradient Moments
(49) In other aspects of the present invention, the linear expansion of k-t-space may use a readout gradient moment with stepwise increases (2G.sub.lδt) every second gradient using a constant gradient duration δ, up to the limits of the gradient performance. Single-shot phase encoding using gradient blips with linearly increasing gradient moment G.sub.l*t are selectively interleaved into the PEPSI readout, with a corresponding increase of the effective spectral dwell time. To minimize the SNR loss in magnetically homogeneous areas, the interleaving will start at the edges of the original k.sub.y-k.sub.z-space and progressively insert single-shot phase encoding into more central k.sub.y-k.sub.z-space encodings as time t increases, as shown in
(50) The k-space dependent time delay Δt of this insertion is Δt=T (k.sub.max−k)/k.sub.max, where Tis the total readout duration and k.sub.max is the extent of the original k-space. To maximize SNR, the extent of k-t-space expansion along the different k-space dimensions is tailored to the orientation and amplitude distribution of local Gradients G.sub.l based on B.sub.0 gradient maps. The SNR scales to at least with the square root of the decrease in voxel size in regions with magnetic field inhomogeneity depending on the histogram of local magnetic field gradients in the volume of interest. This k-t-space expansion method provides a reduction in line width that is comparable to that of increasing spatial resolution, however, with much improved SNR and without increase in scan time. A √{square root over (2)} larger gain in SNR may be obtained in magnetically homogeneous brain regions.
(51) Reconstruction
(52) Zero-filling of time-slice data in the k-space domain is performed as a first step to obtain consistent k-space matrix size across time slices as shown in
(53) Practical Implementation of a PEPSI Pulse Sequence with Dynamic k-Space Expansion
(54) A pulse sequence was implemented on a Siemens Trio scanner (Syngo VB17A) using step-wise increases in readout gradient moments that were realized using readout gradient train segments with increasing readout gradient duration at constant ADC readout bandwidth per pixel. Interleaved alternating gradients are switched along the k.sub.y and k.sub.z axes to encode multiple k.sub.x lines in a single shot. The moments of these phase encoding gradient blips increase from segment to segment to expand k.sub.y-space. The pulse sequence implementation provides flexible control of readout gradient moments, duration of readout gradient train segments, and phase encoding gradient blip moments for each readout gradient train segment and for each phase encoding step, using a combination of mathematical expressions coded in C++ inside the pulse sequence, GUI based parameter selection and a lookup table in form of an external text file to maximize flexibility. An example of the excitation and readout modules of a PEPSI pulse sequence with linear k-space expansion and 2 k.sub.x lines acquired per phase encoding step is shown in
(55)
(56)
(57)
(58) Data were acquired in a spherical phantom containing metabolites and in a healthy control using a Siemens Trio 3 Tesla MRI scanner equipped with 32-channel head array RF coil. Water reference and water suppressed data were acquired in a sagittal or axial slice using TR/TE=2200/15 ms, 32×32 spatial matrix, 8×8×20 mm.sup.3 nominal voxel size and 1:24 min scan time. Water reference data were acquired with 150 readout gradients. Water-suppressed data were acquired with 256 readout gradients. The readout was along the z-axis. Six equidistant readout segments with linearly increasing k-space expansion (1×, 2×, 3×, 4×, 5× and 6×, along both k.sub.x and k.sub.y) were used. Undersampling of k.sub.y-encoding increased from 2-fold in the 3.sup.rd segment to 5-fold in the 6th segment. Accordingly, the acquired spatial data matrix in the 6th readout segment was 392×64 complex data points (readout×phase encoding) and time slice undersampling increased from 2-fold in the 2.sup.nd segment to 6-fold in the 6.sup.th segment. Data were reconstructed offline using zero filling of the readout direction to obtain a consistent matrix size of 392×64 data points (readout×phase encoding) for all time slices.
(59) The k-space expansion method can be expanded to 3D spatial encoding: The preferred implementation of k-space undersampling for a volumetric PEPSI acquisition employs radial undersampling in the k.sub.y-k.sub.z plane that increases with increasing radius.
(60) While the foregoing description applies to MR spectroscopic imaging, the k-space expansion methodology also applies to gradient echo MR imaging and functional MR imaging, reducing magnetic field inhomogeneity related signal losses and sensitivity to movement-related signal changes in regions with magnetic field inhomogeneity.
(61) While the foregoing written description enables one of ordinary skill to make and use what is considered presently to be the best mode thereof, those of ordinary skill will understand and appreciate the existence of variations, combinations, and equivalents of the specific embodiment, method, and examples herein. The disclosure should therefore not be limited by the above-described embodiments, methods, and examples, but by all embodiments and methods within the scope and spirit of the disclosure.