MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Ph.D. / Sc.D.
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Ph.D. / Sc.D.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Accelerating magnetic resonance imaging by unifying sparse models and multiple receivers

Author(s)
Weller, Daniel (Daniel Stuart)
Thumbnail
DownloadFull printable version (15.00Mb)
Alternative title
Accelerating MRI by unifying sparse models and multiple receivers
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Vivek K. Goyal.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Magnetic resonance imaging (MRI) is an increasingly versatile diagnostic tool for a variety of medical purposes. During a conventional MRI scan, samples are acquired along a trajectory in the spatial Fourier transform domain (called k-space) and the image is reconstructed using an inverse discrete Fourier transform. The affordability, availability, and applications of MRI remain limited by the time required to sample enough points of k-space for the desired field of view (FOV), resolution, and signal-to-noise ratio (SNR). GRAPPA, an accelerated parallel imaging method, and compressed sensing (CS) have been successfully employed to accelerate the acquisition process by reducing the number of k-space samples required. GRAPPA leverages the different spatial weightings of each receiver coil to undo the aliasing from the reduction in FOV induced by undersampling k-space. However, accelerated parallel imaging reconstruction methods like GRAPPA amplify the noise present in the data, reducing the SNR by a factor greater than that due to only the level of undersampling. Completely separate from accelerated parallel imaging, which capitalizes on observing data with multiple receivers, CS leverages the sparsity of the object along with incoherent sampling and nonlinear reconstruction algorithms to recover the image from fewer samples. In contrast to parallel imaging, CS actually denoises the result, because noise typically is not sparse. When reconstructing brain images, the discrete wavelet transform and finite differences are effective in producing an approximately sparse representation of the image. Because parallel imaging utilizes the multiple receiver coils and CS takes advantage of the sparsity of the image itself, these methods are complementary, and a combination of these methods would be expected to enable further acceleration beyond what is achievable using parallel imaging or CS alone. This thesis investigates three approaches to leveraging both multiple receiver coils and image sparsity. The first approach involves an optimization framework for jointly optimizing the fidelity to the GRAPPA result and the sparsity of the image. This technique operates in the nullspace of the data observation matrix, preserving the acquired data without resorting to techniques for constrained optimization. While this framework is presented generally, the effectiveness of the implementation depends on the choice of sparsifying transform, sparsity penalty function, and undersampling pattern. The second approach involves modifying the kernel estimation step of GRAPPA to promote sparsity in the reconstructed image and mitigate the noise amplification typically encountered with parallel imaging. The third approach involves imposing a sparsity prior on the coil images and estimating the full k-space from the observations using Bayesian techniques. This third method is extended to jointly estimate the GRAPPA kernel weights and the full k-space together. These approaches represent different frameworks for accelerating MRI imaging beyond current methods. The results presented suggest that these practical reconstruction and post-processing methods allow for greater acceleration with conventional Cartesian acquisitions.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (p. 141-148).
 
Date issued
2012
URI
http://hdl.handle.net/1721.1/75708
Department
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Electrical Engineering and Computer Sciences - Ph.D. / Sc.D.
  • Electrical Engineering and Computer Sciences - Ph.D. / Sc.D.

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.