Doctor of Philosophy

dissertationMagnetic Resonance Imaging (MRI) is one of the most important medical imaging technologies in use today. Unlike other imaging tools, such as X-ray imaging or computed tomography (CT), MRI is noninvasive and without ionizing radiation. A major limitation of MRI, however, is its relatively low imaging speed and low spatial-temporal resolution, as in the case of dynamic contrast enhanced magnetic resonance imaging (DCE-MRI). These hinder the clinical use of MRI. In this thesis, we aim to develop novel signal processing techniques to improve the imaging quality and reduce the imaging time of MRI. This thesis consists of two parts, corresponding to our work on parallel MRI and dynamic MRI, respectively. In the first part, we address an important problem in parallel MRI that the coil sensitivities functions are not known exactly and the estimation error often leads to artifacts in the reconstructed image. First, we develop a new framework based on multichannel blind deconvolution (MBD) to jointly estimate the image and the sensitivity functions. For fully sampled MRI, the proposed approach yields more uniform image reconstructions than that of the sum-of-squares (SOS) and other existing methods. Second, we extend this framework to undersampled parallel MRI and develop a new algorithm, termed Sparse BLIP, for blind iterative parallel image reconstruction using compressed sensing (CS). Sparse BLIP reconstructs both the sensitivity functions and the image simultaneously from the undersampled data, while enforcing the sparseness constraint in the image and sensitivities. Superior image constructions can be obtained by Sparse BLIP when compared to other state-of-the-art methods. In the second part of the thesis, we study highly accelerated DCE-MRI and provide a comparative study of the temporal constraint reconstruction (TCR) versus model-based reconstruction. We find that, at high reduction factors, the choice of baseline image greatly affects the convergence of TCR and the improved TCR algorithm with the proposed baseline initialization can achieve good performance without much loss of temporal or spatial resolution for a high reduction factor of 30. The model-based approach, on the other hand, performs inferior to TCR with even the best phase initialization

Denoising sparse images from GRAPPA using the nullspace method

To accelerate magnetic resonance imaging using uniformly undersampled (nonrandom) parallel imaging beyond what is achievable with generalized autocalibrating partially parallel acquisitions (GRAPPA) alone, the DEnoising of Sparse Images from GRAPPA using the Nullspace method is developed. The trade-off between denoising and smoothing the GRAPPA solution is studied for different levels of acceleration. Several brain images reconstructed from uniformly undersampled k-space data using DEnoising of Sparse Images from GRAPPA using the Nullspace method are compared against reconstructions using existing methods in terms of difference images (a qualitative measure), peak-signal-to-noise ratio, and noise amplification (g-factors) as measured using the pseudo-multiple replica method. Effects of smoothing, including contrast loss, are studied in synthetic phantom data. In the experiments presented, the contrast loss and spatial resolution are competitive with existing methods. Results for several brain images demonstrate significant improvements over GRAPPA at high acceleration factors in denoising performance with limited blurring or smoothing artifacts. In addition, the measured g-factors suggest that DEnoising of Sparse Images from GRAPPA using the Nullspace method mitigates noise amplification better than both GRAPPA and L1 iterative self-consistent parallel imaging reconstruction (the latter limited here by uniform undersampling).National Science Foundation (U.S.) (CAREER Grant 0643836)National Institutes of Health (U.S.) (Grant NIH R01 EB007942)National Institutes of Health (U.S.) (Grant NIH R01 EB006847)National Center for Research Resources (U.S.) (Grant P41 RR014075)Siemens CorporationNational Science Foundation (U.S.). Graduate Research Fellowship Progra

Monte Carlo SURE‐based parameter selection for parallel magnetic resonance imaging reconstruction

Purpose Regularizing parallel magnetic resonance imaging (MRI) reconstruction significantly improves image quality but requires tuning parameter selection. We propose a Monte Carlo method for automatic parameter selection based on Stein's unbiased risk estimate that minimizes the multichannel k‐space mean squared error (MSE). We automatically tune parameters for image reconstruction methods that preserve the undersampled acquired data, which cannot be accomplished using existing techniques. Theory We derive a weighted MSE criterion appropriate for data‐preserving regularized parallel imaging reconstruction and the corresponding weighted Stein's unbiased risk estimate. We describe a Monte Carlo approximation of the weighted Stein's unbiased risk estimate that uses two evaluations of the reconstruction method per candidate parameter value. Methods We reconstruct images using the denoising sparse images from GRAPPA using the nullspace method (DESIGN) and L 1 iterative self‐consistent parallel imaging (L 1 ‐SPIRiT). We validate Monte Carlo Stein's unbiased risk estimate against the weighted MSE. We select the regularization parameter using these methods for various noise levels and undersampling factors and compare the results to those using MSE‐optimal parameters. Results Our method selects nearly MSE‐optimal regularization parameters for both DESIGN and L 1 ‐SPIRiT over a range of noise levels and undersampling factors. Conclusion The proposed method automatically provides nearly MSE‐optimal choices of regularization parameters for data‐preserving nonlinear parallel MRI reconstruction methods. Magn Reson Med 71:1760–1770, 2014. © 2013 Wiley Periodicals, Inc.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/106872/1/mrm24840.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/106872/2/mrm24840-sup-0001-suppinfo.pd