z-logo
Premium
SU‐G‐IeP1‐13: Sub‐Nyquist Dynamic MRI Via Prior Rank, Intensity and Sparsity Model (PRISM)
Author(s) -
Jiang B,
Gao H
Publication year - 2016
Publication title -
medical physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.473
H-Index - 180
eISSN - 2473-4209
pISSN - 0094-2405
DOI - 10.1118/1.4956973
Subject(s) - compressed sensing , prism , nyquist–shannon sampling theorem , nyquist stability criterion , iterative reconstruction , acceleration , computer science , sampling (signal processing) , algorithm , nyquist rate , undersampling , computer vision , artificial intelligence , mathematics , optics , physics , parametric statistics , statistics , filter (signal processing) , classical mechanics
Purpose: Accelerated dynamic MRI is important for MRI guided radiotherapy. Inspired by compressive sensing (CS), sub‐Nyquist dynamic MRI has been an active research area, i.e., sparse sampling in k‐t space for accelerated dynamic MRI. This work is to investigate sub‐Nyquist dynamic MRI via a previously developed CS model, namely Prior Rank, Intensity and Sparsity Model (PRISM). Methods: The proposed method utilizes PRISM with rank minimization and incoherent sampling patterns for sub‐Nyquist reconstruction. In PRISM, the low‐rank background image, which is automatically calculated by rank minimization, is excluded from the L1 minimization step of the CS reconstruction to further sparsify the residual image, thus allowing for higher acceleration rates. Furthermore, the sampling pattern in k‐t space is made more incoherent by sampling a different set of k‐space points at different temporal frames. Results: Reconstruction results from L1‐sparsity method and PRISM method with 30% undersampled data and 15% undersampled data are compared to demonstrate the power of PRISM for dynamic MRI. Conclusion: A sub‐ Nyquist MRI reconstruction method based on PRISM is developed with improved image quality from the L1‐sparsity method.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here