Systems and methods for spiral-in-out low field MRI scans

Patent metadata

Field	Value
Publication number	US-11747419-B2
Application number	US-202217733970-A
Country	US
Kind code	B2
Filing date	Apr 29, 2022
Priority date	Apr 29, 2021
Publication date	Sep 5, 2023
Grant date	Sep 5, 2023

Abstract

Systems and methods for performing ungated magnetic resonance imaging are disclosed herein. A method includes producing magnetic resonance image MRI data by scanning a target in a low magnetic field with a pulse sequence having a spiral trajectory; sampling k-space data from respective scans in the low magnetic field and receiving at least one field map data acquisition and a series of MRI data acquisitions from the respective scans; forming a field map and multiple sensitivity maps in image space from the field map data acquisition; forming target k-space data with the series of MRI data acquisitions; forming initial magnetic resonance images in the image domain by applying a Non-Uniform Fast Fourier Transform to the target k-space data; and forming reconstructed images with a low rank plus sparse (L+S) reconstruction algorithm applied to the initial magnetic resonance images.

First claim

The invention claimed is:

1. A computer implemented method for ungated magnetic resonance imaging, comprising:
producing magnetic resonance imaging (MRI) data corresponding to a target by scanning the target in a low magnetic field with a pulse sequence having a spiral trajectory;
sampling k-space data from respective scans in the low magnetic field and receiving at least one field map data acquisition and a series of MRI data acquisitions from the respective scans;
forming a field map and at least one sensitivity map in image space from the field map data acquisition;
forming target k-space data with the series of MRI data acquisitions with a Non-Uniform Fast Fourier Transform;
forming initial magnetic resonance images in the image domain by applying a gridding operation to the target k-space data; and
forming reconstructed images with a low rank plus sparse (L+S) reconstruction algorithm applied to the initial magnetic resonance images.

2. The computer implemented method of claim 1 , wherein sampling k-space data comprises sampling a continuous series of the respective scans, each scan having the at least one field map data acquisition and the series of MRI data acquisitions.

3. The computer implemented method of claim 1 , wherein the respective scans comprise two field map data acquisitions that are used to form the field map and multiple sensitivity maps in image space.

4. The computer implemented method of claim 1 , wherein the respective scans further comprise dummy cycles, with a data acquisition window in an off state, to achieve a steady state of magnetization before implementing the MRI data acquisitions with the acquisition window in an on state.

5. The computer implemented method of claim 4 , wherein the respective scans comprise 100 dummy cycles.

6. The computer implemented method of claim 5 , wherein the dummy cycles occur after the field data acquisition.

7. The computer implemented method of claim 1 , wherein the respective scans with the series of MRI data acquisitions comprise 384 spiral arms per slice.

8. The computer implemented method of claim 7 , wherein the target is a heart of a patient and the respective scans cover a heart cycle.

9. The computer implemented method of claim 7 , wherein the respective scans utilize a tiny golden angle rotation along the time domain to reduce the eddy current effect when alternating the gradient polarity.

10. The computer implemented method of claim 1 , wherein the series of MRI data acquisitions comprise a variable density spiral-in-out trajectory scan.

11. The computer implemented method of claim 10 , wherein the variable density spiral-in-out scan comprises a 4 ms readout length to sample a frame of the target k-space data at positions proximate a center of the frame.

12. The computer implemented method of claim 11 , wherein the variable density spiral-in-out scan reduces coherence of under-sampling aliasing patterns to improve characteristics for the L+S reconstruction algorithm.

13. The computer implemented method of claim 1 , wherein the reconstructed images comprise corrections for blurring artifacts and aliasing artifacts by modifying the initial images in accordance with the field map, the sensitivity map and the L+S algorithm.

14. The computer implemented method of claim 1 , wherein the low magnetic field strength is less than 1 Tesla.

15. The computer implemented method of claim 1 wherein the low magnetic field is 0.55 Tesla.

16. The computer implemented method of claim 1 , further comprising utilizing balanced steady state free precession (bSSFP) sequences in the cardiac imaging.

17. The computer implemented method of claim 1 , further comprising under-sampling target k-space data using a spiral-in-out trajectory.

18. The computer implemented method of claim 17 , further comprising under-sampling by a factor of 8.

19. A system for ungated magnetic resonance imaging, comprising:
a magnetic resonance imaging device configured to produce magnetic resonance imaging (MRI) data corresponding to a target; and
one or more processors in data communication with computer memory and the magnetic resonance imaging device, wherein the one or more processors are configured to cause the system to perform a computer implemented method comprising:
scanning the target in a low magnetic field with a pulse sequence having a spiral trajectory;
sampling k-space data from respective scans in the low magnetic field and receiving at least one field map data acquisition and a series of MRI data acquisitions from the respective scans;
forming a field map and multiple sensitivity maps in image space from the field map data acquisition;
forming target k-space data with the series of MRI data acquisitions;
forming initial magnetic resonance images in the image domain by applying a Non-Uniform Fast Fourier Transform and gridding the target k-space data; and
forming reconstructed images with a low rank plus sparse (L+S) reconstruction algorithm applied to the initial magnetic resonance images.

20. A non-transitory computer-readable medium having stored instructions that, when executed by one or more processors, cause a magnetic resonance imaging system to perform a computer implemented method that comprises:
scanning a target in a low magnetic field with a pulse sequence having a spiral trajectory;
sampling k-space data from respective scans in the low magnetic field and receiving at least one field map data acquisition and a series of MRI data acquisitions from the respective scans;
forming a field map and multiple sensitivity maps in image space from the field map data acquisition;
forming target k-space data with the series of MRI data acquisitions;
forming initial magnetic resonance images in the image domain by applying a Non-Uniform Fast Fourier Transform and gridding the target k-space data; and
forming reconstructed images with a low rank plus sparse (L+S) reconstruction algorithm applied to the initial magnetic resonance images.

Assignees

• Univ Virginia Patent Foundation

Inventors

• Wang Zhixing
• Feng Xue
• Mugler Iii John P
• Salerno Michael
• Campbell-Washburn Adrienne E
• Meyer Craig H

Classifications

• G01R33/4818 Primary

  MR characterised by data acquisition along a specific k-space trajectory or by the temporal order of k-space coverage, e.g. centric or segmented coverage of k-space · CPC title

• G01R33/448

  Relaxometry, i.e. quantification of relaxation times or spin density (G01R33/50 takes precedence) · CPC title

• G01R33/543

  Control of the operation of the MR system, e.g. setting of acquisition parameters prior to or during MR data acquisition, dynamic shimming, use of one or more scout images for scan plane prescription (G01R33/546 takes precedence) · CPC title

• G01R33/5613

  Generating steady state signals, e.g. low flip angle sequences [FLASH] · CPC title

• G01R33/56518

  due to eddy currents, e.g. caused by switching of the gradient magnetic field · CPC title