Change search
ReferencesLink to record
Permanent link

Direct link
Algorithms for representation of 3D regions in radiotherapy planning software
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2013 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis reviews the fast marching method as a technique for computing the distance transform on GPU in the context of a radiotherapy planning software. The method has some interesting characteristics that, given the right circumstances, allow the distance transform to be computed for fewer voxels than commonly used alternatives. This can result in beneficial effects both with regards to memory consumption and computation speed. A prototype  is implemented to evaluate the features of the fast marching method including its suitability for execution on GPU. The implementation uses NVidia’s Thrust library in order to assess it as a means of achieving performance portability, i.e. producing code that can be efficiently executed both on GPU and CPU.

The fast marching method is evaluated based on speed, memory consumption and accuracy. These measurements are compared to an existing method for computing the distance transform in order to put the results into context. The assessment of the Thrust library is based on the experience of implementing the prototype. It is analyzed with regards to aspects such as the perceived ease of implementing the algorithm and the efficiency of the resulting solution.

The conclusion of this thesis is that the fast marching method may well be a suitable approach for computing the distance transform on GPU. This is based on results in best case scenarios showing twice as fast computation speeds while only using a tenth of the memory compared to the chosen benchmark method. With regards to the Thrust library, however, this thesis concludes that it is not suitable for the implementation of an algorithm of this complexity. The impression is that thedevelopment of the prototype  has been severely hampered by the use of Thrust and the performance of the resulting code is poor. This is demonstrated  by a part of the prototype  being re-implemented using CUDA resulting in a speedup for that part of between five and thirty times, depending on the scenario.

Place, publisher, year, edition, pages
UPTEC IT, ISSN 1401-5749 ; 13 005
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-198493OAI: diva2:616281
Educational program
Master of Science Programme in Information Technology Engineering
Available from: 2013-04-16 Created: 2013-04-16 Last updated: 2013-04-16Bibliographically approved

Open Access in DiVA

fulltext(2361 kB)392 downloads
File information
File name FULLTEXT01.pdfFile size 2361 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 392 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 295 hits
ReferencesLink to record
Permanent link

Direct link