• Corpus ID: 7423510

k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity

@inproceedings{Lustig2006ktSH,
  title={k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity},
  author={Michael Lustig and Juan M. Santos and David L. Donoho and John M. Pauly},
  year={2006}
}
M. Lustig, J. M. Santos, D. L. Donoho, J. M. Pauly Electrical Engineering, Stanford University, Stanford, CA, United States, Statistics, Stanford University, Stanford, CA, United States Introduction Recently rapid imaging methods that exploit the spatial sparsity of images using under-sampled randomly perturbed spirals and non-linear reconstruction have been proposed [1,2]. These methods were inspired by theoretical results in sparse signal recovery [1-5] showing that sparse or compressible… 

Figures from this paper

Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR

TLDR
A novel algorithm to reconstruct dynamic magnetic resonance imaging data from under-sampled k-t space data using the compact representation of the data in the Karhunen Louve transform (KLT) domain to exploit the correlations in the dataset.

Motion-Adaptive Spatio-Temporal Regularization ( MASTeR ) for Accelerated Dynamic MRI

TLDR
A new recovery algorithm, motion-adaptive spatio-temporal regularization (MASTeR), which uses compressed sensing principles to recover dynamic MR images from highly undersampled kspace data, takes advantage of spatial and temporal structured sparsity in MR images.

Compressed Sensing Dynamic Cardiac Cine MRI Using Learned Spatiotemporal Dictionary

TLDR
A novel technique that employs a patch-based 3-D spatiotemporal dictionary for sparse representations of dynamic image sequence in the CS framework that is able to accelerate cardiac cine imaging and outperforms the existing state-of-the-art CS methods at high accelerations.

Group sparse reconstruction using intensity‐based clustering

TLDR
This work proposes to modify k‐t GS by incorporating prior information about the sorted intensity of the signal in the sparse representation, for a more general and robust group assignment, referred to as group sparse reconstruction using intensity‐based clustering.

Motion Adaptive Patch-Based Low-Rank Approach for Compressed Sensing Cardiac Cine MRI

TLDR
A novel patch-based reconstruction method to exploit geometric similarities in the spatio-temporal domain using a low rank constraint for similar patches along motion, based on the observation that rank structures are relatively less sensitive to global intensity changes, but make it easier to capture moving edges.

Accelerating k-t sparse using k-space aliasing for dynamic MRI imaging

  • K. PawarG. EganJingxin Zhang
  • Computer Science
    2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
  • 2013
TLDR
This paper presents a novel method to combine k-t sparse and k-space aliasing to achieve higher acceleration than each of the individual technique alone, and demonstrates in simulation on cardiac data.

Distortion-optimal parallel MRI with sparse sampling: from adaptive spatio-temporal acquisition to self-calibrating reconstruction

TLDR
A highly-accelerated real-time dynamic MRI technique, dubbed PARADISE, which incorporates a physiologically-driven sparse support model in the joint spatial domain and temporal frequency dimension, and the efficacy of a geometric multi-channel sampling design algorithm that does not require explicit knowledge of the channel characteristics is proposed and verified.

Compressive sensing recovery of dynamic MRI via nonlocal low-rank regularization

TLDR
Experimental results show that the proposed CS recovery of dynamic MRI from partially sampled k-t space using the nonlocal low-rank regularization (NLR) can outperform existing state-of-the-art dynamic MRI reconstruction methods.

Sparse MRI: The application of compressed sensing for rapid MR imaging

TLDR
Practical incoherent undersampling schemes are developed and analyzed by means of their aliasing interference and demonstrate improved spatial resolution and accelerated acquisition for multislice fast spin‐echo brain imaging and 3D contrast enhanced angiography.
...

References

SHOWING 1-8 OF 8 REFERENCES

Practical Signal Recovery from Random Projections

TLDR
It is demonstrated empirically that it is possible to recover an object from about 3M ‐5M projections onto generically chosen vectors with the same accuracy as the ideal M -term wavelet approximation.

Simulated dynamic data

  • Magn Reson Med
  • 1999

Magn Reson Med. Nov

  • Magn Reson Med. Nov
  • 2003

Magn Reson Med. Nov

  • Magn Reson Med. Nov
  • 1999

Rapid MR Angiography … " Accepted SCMR06

  • Rapid MR Angiography … " Accepted SCMR06

Why Simple Shrinkage is Still Relevant?" Manuscript

  • Why Simple Shrinkage is Still Relevant?" Manuscript

Robust Uncertainty principals

  • Robust Uncertainty principals

Compressesed Sensing " . Manuscript

  • Compressesed Sensing " . Manuscript