liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Kaijsers algoritm för beräkning av Kantorovichavstånd parallelliserad i CUDA
Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
2013 (Swedish)Independent thesis Basic level (university diploma), 10,5 credits / 16 HE creditsStudent thesis
Abstract [en]

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications.

Place, publisher, year, edition, pages
2013. , 35 p.
Keyword [en]
GPGPU, CUDA, Kantorovich distance
National Category
Other Engineering and Technologies not elsewhere specified
URN: urn:nbn:se:liu:diva-102867ISRN: LiTH-ISY-EX-ET--13/0414—SEOAI: diva2:683472
Subject / course
Computer Engineering
Available from: 2014-01-07 Created: 2014-01-03 Last updated: 2014-01-07Bibliographically approved

Open Access in DiVA

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

Search in DiVA

By author/editor
Engvall, Sebastian
By organisation
Information CodingThe Institute of Technology
Other Engineering and Technologies not elsewhere specified

Search outside of DiVA

GoogleGoogle Scholar
Total: 117 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: 178 hits
ReferencesLink to record
Permanent link

Direct link