This work aims to demonstrate that radial acquisition with k-space variant reduced-FOV reconstruction can enable real-time cardiac MRI with an affordable computation cost. Due to non-uniform sampling, radial imaging requires k-space variant reconstruction for optimal performance. By converting radial parallel imaging reconstruction into the estimation of correlation functions with a previously-developed correlation imaging framework, Cartesian k-space may be reconstructed point-wisely based on parallel imaging relationship between every Cartesian datum and its neighboring radial samples. Furthermore, reduced-FOV correlation functions may be used to calculate a subset of Cartesian k-space data for image reconstruction within a small region of interest, making it possible to run real-time cardiac MRI with an affordable computation cost. In a stress cardiac test where the subject is imaged during biking with a heart rate of >100 bpm, this k-space variant reduced-FOV reconstruction is demonstrated in reference to several radial imaging techniques including gridding, GROG and SPIRiT. It is found that the k-space variant reconstruction outperforms gridding, GROG and SPIRiT in real-time imaging. The computation cost of reduced-FOV reconstruction is ~2 times higher than that of GROG. The presented work provides a practical solution to real-time cardiac MRI with radial acquisition and k-space variant reduced-FOV reconstruction in clinical settings.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6425753 | PMC |
http://dx.doi.org/10.1016/j.mri.2018.07.008 | DOI Listing |
NMR Biomed
December 2024
Department of Electronic Information Engineering, Nanchang University, Nanchang, China.
J Magn Reson
February 2024
Jožef Stefan Institute, Ljubljana, Slovenia; Institute of Anatomy, Faculty of Medicine, University of Ljubljana, Ljubljana, Slovenia. Electronic address:
Rapid MR imaging of slowly relaxing samples is often challenging. The most commonly used solutions are found in multi spin-echo (RARE) sequences or gradient-echo (GE) sequences, which allow faster imaging of such samples with multiple acquisitions of k-space lines per excitation or imaging with very short repetition times (TRs). Another solution is the use of a spin-echo (SE) sequence superimposed with a driven equilibrium Fourier transform (DEFT) method.
View Article and Find Full Text PDFMagn Reson Med
March 2024
Center for Biomedical Imaging, Department of Radiology, New York University Grossman School of Medicine, New York, New York, USA.
Purpose: To minimize eddy current artifacts in periodic pulse sequences with balanced gradient moments as, for example, used for quantitative MRI.
Theory And Methods: Eddy current artifacts in balanced sequences result from large jumps in k-space. In quantitative MRI, one often samples some spin dynamics repeatedly while acquiring different parts of k-space.
Magn Reson Med
August 2023
Wellcome Centre for Integrative Neuroimaging, FMRIB Division, Nuffield Department of Clinical Neurosciences, University of Oxford, Oxford, UK.
Purpose: To develop an accelerated 3D intracranial time-of-flight (TOF) magnetic resonance angiography (MRA) sequence with wave-encoding (referred to as 3D wave-TOF) and to evaluate two variants: wave-controlled aliasing in parallel imaging (CAIPI) and compressed-sensing wave (CS-wave).
Methods: A wave-TOF sequence was implemented on a 3 T clinical scanner. Wave-encoded and Cartesian k-space datasets from six healthy volunteers were retrospectively and prospectively undersampled with 2D-CAIPI sampling and variable-density Poisson disk sampling.
Comput Methods Programs Biomed
May 2023
School of Computer Science & Technology, Beijing Institute of Technology, No. 5, South Street, Zhongguancun, Beijing, 100081, China. Electronic address:
Magnetic resonance imaging (MRI) has become one of the most powerful imaging techniques in medical diagnosis, yet the prolonged scanning time becomes a bottleneck for application. Reconstruction methods based on compress sensing (CS) have made progress in reducing this cost by acquiring fewer points in the k-space. Traditional CS methods impose restrictions from different sparse domains to regularize the optimization that always requires balancing time with accuracy.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!