<div class="csl-bib-body">
<div class="csl-entry">Barsukov, Y. (2013). <i>Development of GPICP, a GPU-only registration algorithm based on iterative closest point</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21784</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2013.21784
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/8117
-
dc.description
Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers
-
dc.description
Zsfassung in dt. Sprache
-
dc.description.abstract
The ICP algorithm, developed by Besl and McKay, has long been the -golden standard- for solving the registration problem. With the recent increase in programmability of GPUs, their parallel programming model has become a perfect medium for ICP. The goal of this work was to develop an ICP implementation that could run entirely on the GPU, solving the problems imposed by the GPU architecture and harvesting increased performance in an effort to make the registration more accurate.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
GPGPU
de
dc.subject
ICP
de
dc.subject
Iterative Closest Point
de
dc.subject
Registrierung
de
dc.subject
CUDA
de
dc.subject
GPGPU
en
dc.subject
ICP
en
dc.subject
Iterative Closest Point
en
dc.subject
registration
en
dc.subject
CUDA
en
dc.title
Development of GPICP, a GPU-only registration algorithm based on iterative closest point
en
dc.title.alternative
Development of GPICP, a GPU-only registration algorithm based on Iterative Closest Point
de
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2013.21784
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Yaroslav Barsukov
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
dc.contributor.assistant
Aldoma-Buchaca, Aitor
-
tuw.publication.orgunit
E376 - Institut für Automatisierungs- und Regelungstechnik
