Show simple item record

dc.contributor.advisorDaniel K. Sodickson.en_US
dc.contributor.authorYeh, Ernest Nanjung, 1975-en_US
dc.contributor.otherHarvard University--MIT Division of Health Sciences and Technology.en_US
dc.date.accessioned2008-02-28T16:13:47Z
dc.date.available2008-02-28T16:13:47Z
dc.date.copyright2005en_US
dc.date.issued2005en_US
dc.identifier.urihttp://dspace.mit.edu/handle/1721.1/33078en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/33078
dc.descriptionThesis (Ph. D.)--Harvard-MIT Division of Health Sciences and Technology, 2005.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractImaging speed is a crucial consideration for magnetic resonance imaging (MRI). The speed of conventional MRI is limited by hardware performance and physiological safety measures. "Parallel" MRI is a new technique that circumvents these limitations by utilizing arrays of radiofrequency detector coils to acquire data in parallel, thereby enabling still higher imaging speeds. In parallel MRI, coil arrays are used to accomplish part of the spatial encoding that was traditionally performed by magnetic field gradients alone. MR signal data acquired with coil arrays are spatially encoded with the distinct reception patterns of the individual coil elements. T[he quality of parallel MR images is dictated by the accuracy and efficiency of an image reconstruction (decoding) strategy. This thesis formulates the spatial encoding and decoding of parallel MRI as a generalized linear inverse problem. Under this linear algebraic framework, theoretical and empirical limits on the performance of parallel MR image reconstructions are characterized, and solutions are proposed to facilitate routine clinical and research applications. Each research study presented in this thesis addresses one or more elements in the inverse problem, and the studies are collectively arranged to reflect three progressive stages in solving the inverse problem: 1) determining the encoding matrix, 2) computing a matrix inverse, 3) characterizing the error involved. First, a self-calibrating strategy is proposed which uses non-Cartesian trajectories to automatically determine coil sensitivities without the need of an external scan or modification of data acquisition, guaranteeing an accurate formulation of the encoding matrix.en_US
dc.description.abstract(cont.) Second, two matrix inversion strategies are presented which, respectively, exploit physical properties of coil encoding and the phase information of the magnetization. While the former allows stable and distributable matrix inversion using the k-space locality principle, the latter integrates parallel image reconstruction with conjugate symmetry. Third, a numerical strategy is presented for computing noise statistics of parallel MRI techniques which involve magnitude image combination, enabling quantitative image comparison. In addition, fundamental limits on the performance of parallel image reconstruction are derived using the Cramer-Rao bounds. Lastly, the practical applications of techniques developed in this thesis are demonstrated by a case study in improved coronary angiography.en_US
dc.format.extent180 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/33078en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectHarvard University--MIT Division of Health Sciences and Technology.en_US
dc.titleAdvanced image reconstruction in parallel magnetic resonance imaging : constraints and solutions.en_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentHarvard University--MIT Division of Health Sciences and Technology
dc.identifier.oclc62148316en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record