Radial k-t FOCUSS for high-resolution cardiac cine MRI

Magn Reson Med. 2010 Jan;63(1):68-78. doi: 10.1002/mrm.22172.

Abstract

A compressed sensing dynamic MR technique called k-t FOCUSS (k-t FOCal Underdetermined System Solver) has been recently proposed. It outperforms the conventional k-t BLAST/SENSE (Broad-use Linear Acquisition Speed-up Technique/SENSitivity Encoding) technique by exploiting the sparsity of x-f signals. This paper applies this idea to radial trajectories for high-resolution cardiac cine imaging. Radial trajectories are more suitable for high-resolution dynamic MRI than Cartesian trajectories since there is smaller tradeoff between spatial resolution and number of views if streaking artifacts due to limited views can be resolved. As shown for Cartesian trajectories, k-t FOCUSS algorithm efficiently removes artifacts while preserving high temporal resolution. k-t FOCUSS algorithm applied to radial trajectories is expected to enhance dynamic MRI quality. Rather than using an explicit gridding method, which transforms radial k-space sampling data to Cartesian grid prior to applying k-t FOCUSS algorithms, we use implicit gridding during FOCUSS iterations to prevent k-space sampling errors from being propagated. In addition, motion estimation and motion compensation after the first FOCUSS iteration were used to further sparsify the residual image. By applying an additional k-t FOCUSS step to the residual image, improved resolution was achieved. In vivo experimental results show that this new method can provide high spatiotemporal resolution even from a very limited radial data set.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Heart / anatomy & histology*
  • Image Enhancement / methods*
  • Image Interpretation, Computer-Assisted / methods*
  • Magnetic Resonance Imaging, Cine / instrumentation
  • Magnetic Resonance Imaging, Cine / methods*
  • Phantoms, Imaging
  • Reproducibility of Results
  • Sensitivity and Specificity
  • Signal Processing, Computer-Assisted*