Abstract
PurposeThe gradient‐echo‐train‐based Sub‐millisecond Periodic Event Encoded Dynamic Imaging (get‐SPEEDI) technique provides ultrahigh temporal resolutions (∼0.6 ms) for detecting rapid physiological activities, but its practical adoption can be hampered by long scan times. This study aimed at developing a more efficient variant of get‐SPEEDI for reducing the scan time without degrading temporal resolution or image quality.MethodsThe proposed pulse sequence, named k‐t get‐SPEEDI, accelerated get‐SPEEDI acquisition by undersampling the k‐space phase‐encoding lines semi‐randomly. At each time frame, k‐space was fully sampled in the central region whereas randomly undersampled in the outer regions. A time‐series of images was reconstructed using an algorithm based on the joint partial separability and sparsity constraints. To demonstrate the performance of k‐t get‐SPEEDI, images of human aortic valve opening and closing were acquired with 0.6‐ms temporal resolution and compared with those from conventional get‐SPEEDI.Resultsk‐t get‐SPEEDI achieved a 2‐fold scan time reduction over the conventional get‐SPEEDI (from ∼6 to ∼3 min), while achieving comparable SNRs and contrast‐to‐noise ratio (CNRs) for visualizing the dynamic process of aortic valve: SNR/CNR ≈ 70/38 vs. 73/39 in the k‐t and conventional get‐SPEEDI scans, respectively. The time courses of aortic valve area also matched well between these two sequences with a correlation coefficient of 0.86.ConclusionsThe k‐t get‐SPEEDI pulse sequence was able to half the scan time without compromising the image quality and ultrahigh temporal resolution. Additional scan time reduction may also be possible, facilitating in vivo adoptions of SPEEDI techniques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.