7337

High Speed Compressed Sensing Reconstruction in Dynamic Parallel MRI Using Augmented Lagrangian and Parallel Processing

Cagdas Bilen, Yao Wang, Ivan Selesnick
Department of Electrical Engineering, Polytechnic Institute of NYU, Brooklyn, NY, USA
arXiv:1203.4587v1 [cs.IT] (20 Mar 2012)

@article{2012arXiv1203.4587B,

   author={Bilen}, C. and {Wang}, Y. and {Selesnick}, I.},

   title={"{High Speed Compressed Sensing Reconstruction in Dynamic Parallel MRI Using Augmented Lagrangian and Parallel Processing}"},

   journal={ArXiv e-prints},

   archivePrefix={"arXiv"},

   eprint={1203.4587},

   primaryClass={"cs.IT"},

   keywords={Computer Science – Information Theory, Computer Science – Data Structures and Algorithms},

   year={2012},

   month={mar},

   adsurl={http://adsabs.harvard.edu/abs/2012arXiv1203.4587B},

   adsnote={Provided by the SAO/NASA Astrophysics Data System}

}

Download Download (PDF)   View View   Source Source   

856

views

Magnetic Resonance Imaging (MRI) is one of the fields that the compressed sensing theory is well utilized to reduce the scan time significantly leading to faster imaging or higher resolution images. It has been shown that a small fraction of the overall measurements are sufficient to reconstruct images with the combination of compressed sensing and parallel imaging. Various reconstruction algorithms has been proposed for compressed sensing, among which Augmented Lagrangian based methods have been shown to often perform better than others for many different applications. In this paper, we propose new Augmented Lagrangian based solutions to the compressed sensing reconstruction problem with analysis and synthesis prior formulations. We also propose a computational method which makes use of properties of the sampling pattern to significantly improve the speed of the reconstruction for the proposed algorithms in Cartesian sampled MRI. The proposed algorithms are shown to outperform earlier methods especially for the case of dynamic MRI for which the transfer function tends to be a very large matrix and significantly ill conditioned. It is also demonstrated that the proposed algorithm can be accelerated much further than other methods in case of a parallel implementation with graphics processing units (GPUs).
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: