Show simple item record

dc.contributor.advisorAruliah, Dhavide
dc.contributor.authorTakeva-Velkova, Viliyana
dc.date.accessioned2010-10-13T20:40:19Z
dc.date.accessioned2022-03-29T17:06:31Z
dc.date.available2010-10-13T20:40:19Z
dc.date.available2022-03-29T17:06:31Z
dc.date.issued2010-06-01
dc.identifier.urihttps://hdl.handle.net/10155/104
dc.description.abstractMagnetic Resonance Imaging (MRI) is an essential instrument in clinical diag- nosis; however, it is burdened by a slow data acquisition process due to physical limitations. Compressive Sensing (CS) is a recently developed mathematical framework that o ers signi cant bene ts in MRI image speed by reducing the amount of acquired data without degrading the image quality. The process of image reconstruction involves solving a nonlinear constrained optimization problem. The reduction of reconstruction time in MRI is of signi cant bene t. We reformulate sparse MRI reconstruction as a Second Order Cone Program (SOCP).We also explore two alternative techniques to solving the SOCP prob- lem directly: NESTA and speci cally designed SOCP-LB.en
dc.description.sponsorshipUniversity of Ontario Institute of Technologyen
dc.language.isoenen
dc.subjectCompressive sensingen
dc.subjectSparse MRIen
dc.subjectConvex optimizationen
dc.titleOptimization algorithms in compressive sensing (CS) sparse magnetic resonance imaging (MRI)en
dc.typeThesisen
dc.degree.levelMaster of Science (MSc)en
dc.degree.disciplineModelling and Computational Scienceen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record