Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorvan Leeuwen, Dr. T.
dc.contributor.authorHutter, J.D.
dc.date.accessioned2019-02-11T18:00:32Z
dc.date.available2019-02-11T18:00:32Z
dc.date.issued2019
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/31832
dc.description.abstractTypical computed tomography reconstruction algorithms require the CT scanner to scan around the full 180 degrees of the object, discretizing the image reconstruction problem in order to make an approximation of the original image. We restrict the problem to the premise of non-overlapping rectangles forming the image and compute the exact Radon Transform of the image. Then the inverse problem is: given a certain number of projections, find the configuration of rectangles (of different sizes and orientations) which best match with the projection data. Given this assumption, a new algebraic method is developed. For larger problems (many projections of many rectangles), this method becomes computationally inefficient and instead a binary linear programming problem is formulated. Both methods require only a few CT scan measurements and produce accurate approximations of the original image.
dc.description.sponsorshipUtrecht University
dc.format.extent4027124
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleImage reconstruction for rectangular shapes in computed tomography
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsCT; computed tomography; rectangles; binary linear programming
dc.subject.courseuuWiskunde


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record