A fast Edge‐preserving Bayesian reconstruction method for Parallel Imaging applications in cardiac MRI

Among recent parallel MR imaging reconstruction advances, a Bayesian method called Edge‐preserving Parallel Imaging reconstructions with GRAph cuts Minimization (EPIGRAM) has been demonstrated to significantly improve signal‐to‐noise ratio when compared with conventional regularized sensitivity encoding method. However, EPIGRAM requires a large number of iterations in proportion to the number of intensity labels in the image, making it computationally expensive for high dynamic range images. The objective of this study is to develop a Fast EPIGRAM reconstruction based on the efficient binary jump move algorithm that provides a logarithmic reduction in reconstruction time while maintaining image quality. Preliminary in vivo validation of the proposed algorithm is presented for two‐dimensional cardiac cine MR imaging and three‐dimensional coronary MR angiography at acceleration factors of 2–4. Fast EPIGRAM was found to provide similar image quality to EPIGRAM and maintain the previously reported signal‐to‐noise ratio improvement over regularized sensitivity encoding method, while reducing EPIGRAM reconstruction time by 25–50 times. Magn Reson Med, 2010. © 2010 Wiley‐Liss, Inc.

[1]  N. Pelc,et al.  Making Better SENSE : Wavelet Denoising , Tikhonov Regularization , and Total Least Squares , 2001 .

[2]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  P. Boesiger,et al.  SENSE: Sensitivity encoding for fast MRI , 1999, Magnetic resonance in medicine.

[4]  W. Manning,et al.  Simultaneous acquisition of spatial harmonics (SMASH): Fast imaging with radiofrequency coil arrays , 1997, Magnetic resonance in medicine.

[5]  K. Kwong,et al.  Parallel imaging reconstruction using automatic regularization , 2004, Magnetic resonance in medicine.

[6]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Stan Z. Li,et al.  Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.

[8]  VekslerOlga,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001 .

[9]  S. Schoenberg,et al.  Practical approaches to the evaluation of signal‐to‐noise ratio performance with parallel imaging: Application with cardiac imaging and a 32‐channel cardiac coil , 2005, Magnetic resonance in medicine.

[10]  Pascal Spincemaille,et al.  Improved magnetization preparation for navigator steady‐state free precession 3D coronary MR angiography , 2004, Magnetic resonance in medicine.

[11]  Gurmeet Singh,et al.  MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts , 2006, CVPR.

[12]  Peter Kellman,et al.  Image reconstruction in SNR units: A general method for SNR measurement † , 2005, Magnetic resonance in medicine.

[13]  L. Ying,et al.  On Tikhonov regularization for image reconstruction in parallel MRI , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[14]  R. Zabih,et al.  Efficient Graph-Based Energy Minimization Methods in Computer Vision , 1999 .

[15]  L. Ying,et al.  Regularized sensitivity encoding (SENSE) reconstruction using bregman iterations , 2009, Magnetic resonance in medicine.

[16]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Robin M Heidemann,et al.  Generalized autocalibrating partially parallel acquisitions (GRAPPA) , 2002, Magnetic resonance in medicine.

[18]  R. Zabih,et al.  Bayesian parallel imaging with edge‐preserving priors , 2007, Magnetic resonance in medicine.