It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Magnetic Resonance Imaging (MRI) non-invasively measures high-resolution images of soft tissue contrast in human anatomy without any ionizing radiation or injection of contrast agent. However, MRI incurs large costs to patients and researchers due to expensive equipment and slow imaging times. Significant research effort in the MRI field aims to reduce costs by developing techniques that increase information per unit time acquired by the scanner. This thesis presents methods that combine our knowledge of MRI physics with modern computational techniques to design algorithms that improve acquisition efficiency.
We first propose SPARK, a machine learning method for reconstructing images from accelerated structural MRI acquisitions trained from just a single scan. Spark exploits calibration regions to train neural networks that correct a physics based input reconstruction, improving performance at smaller calibration sizes and synergizing with a wide range of techniques. We next introduce Latent Signal Models for time-resolved MRI reconstruction. Latent Signal Models trains neural-networks to approximate the Bloch equations, and inserts the models directly into the MRI reconstruction problem. This enables fast optimization through a proxy for the Bloch equations and yields fewer degrees of freedom than linear models. Third, we explore cramer-rao-bound optimization of sequences for quantitative MR parameter mapping. Auto-differentiation through simulations computes necessary gradients for optimization. Finally, we propose an optimization scheme that designs radio-frequency pulse amplitudes for reduced heating in Fetal MRI, while maintaining signal-to-noise and contrast-to-noise ratios.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer





