Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/12487
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorAnand, Christopheren_US
dc.contributor.advisorKahl, Wolframen_US
dc.contributor.authorMoghadas, Maryamen_US
dc.date.accessioned2014-06-18T16:59:48Z-
dc.date.available2014-06-18T16:59:48Z-
dc.date.created2012-09-17en_US
dc.date.issued2012-10en_US
dc.identifier.otheropendissertations/7370en_US
dc.identifier.other8426en_US
dc.identifier.other3325960en_US
dc.identifier.urihttp://hdl.handle.net/11375/12487-
dc.description.abstract<p>This thesis gives a partial answer to the question: “Can type systems detect modeling errors in scientific computing, particularly for inverse problems derived from physical models?” by considering, in detail, the major aspects of inverse problems in Magnetic Resonance Imaging (MRI). We define a type-system that can capture all correctness properties for MRI inverse problems, including many properties that are not captured with current type-systems, e.g., frames of reference. We implemented a type-system in the Haskell language that can capture the errors arising in translating a mathe- matical model into a linear or nonlinear system, or alternatively into an objective function. Most models are (or can be approximated by) linear transformations, and we demonstrate the feasibility of capturing their correctness at the type level using what is arguably the most difficult case, the (discrete) Fourier transformation (DFT). By this, we mean that we are able to catch, at compile time, all known errors in ap- plying the DFT. The first part of this thesis describes the Haskell implementation of vector size, physical units, frame of reference, and so on required in the mathemat- ical modelling of inverse problems without regularization. To practically solve most inverse problems, especially those including noisy data or ill-conditioned systems, one must use regularization. The second part of this thesis addresses the question of defining new regularizers and identifying existing regularizers the correctness of which (in our estimation) can be formally verified at the type level. We describe such Bayesian regularization schemes based on probability theory, and describe a novel simple regularizer of this type. We leave as future work the formalization of such regularizers.</p>en_US
dc.subjecttype-safetyen_US
dc.subjectInverse Imaging Problemen_US
dc.subjectType Level Programmingen_US
dc.subjectHaskellen_US
dc.subjectRegularizationen_US
dc.subjectformalizationen_US
dc.subjectNumerical Analysis and Scientific Computingen_US
dc.subjectProgramming Languages and Compilersen_US
dc.subjectNumerical Analysis and Scientific Computingen_US
dc.titleType-Safety for Inverse Imaging Problemsen_US
dc.typethesisen_US
dc.contributor.departmentComputing and Softwareen_US
dc.description.degreeMaster of Science (MSc)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
1.76 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue