Cached k-d tree search for ICP algorithms
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Nüchter, A. | |
dc.contributor.author | Lingemann, K. | |
dc.contributor.author | Hertzberg, J. | |
dc.date.accessioned | 2021-12-23T16:29:56Z | - |
dc.date.available | 2021-12-23T16:29:56Z | - |
dc.date.issued | 2007 | |
dc.identifier.isbn | 9780769529394 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/16436 | - |
dc.description | Conference of 6th International Conference on 3-D Digital Imaging and Modeling, 3DIM 2007 ; Conference Date: 21 August 2007 Through 23 August 2007; Conference Code:72666 | |
dc.description.abstract | The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of three-dimensional models when an initial relative pose estimate is available. The basis of ICP is the search for closest points. Since the development of ICP, k-d trees have been used to accelerate the search. This paper presents a novel search procedure, namely cached k-d trees, exploiting iterative behavior of the ICP algorithm. It results in a significant speedup of about 50% as we show in an evaluation using different data sets. © 2007 IEEE. | |
dc.language.iso | en | |
dc.relation.ispartof | 3DIM 2007 - Proceedings 6th International Conference on 3-D Digital Imaging and Modeling | |
dc.subject | Algorithms | |
dc.subject | Boolean functions | |
dc.subject | Bubbles (in fluids) | |
dc.subject | Digital arithmetic | |
dc.subject | Inductively coupled plasma | |
dc.subject | Iterative methods | |
dc.subject | Standards | |
dc.subject | Three dimensional, Closest points | |
dc.subject | Data sets | |
dc.subject | De facto standards | |
dc.subject | Digital imaging | |
dc.subject | Geometric alignment | |
dc.subject | International conferences | |
dc.subject | Iterative closest point (ICP) | |
dc.subject | Iterative closest point (ICP) algorithm | |
dc.subject | Iterative closet point (ICP) algorithms | |
dc.subject | K D trees | |
dc.subject | Relative pose | |
dc.subject | Search procedures | |
dc.subject | Three dimensional (3 D) modeling, Trees (mathematics) | |
dc.title | Cached k-d tree search for ICP algorithms | |
dc.type | conference paper | |
dc.identifier.doi | 10.1109/3DIM.2007.15 | |
dc.identifier.scopus | 2-s2.0-47349094672 | |
dc.identifier.url | https://www.scopus.com/inward/record.uri?eid=2-s2.0-47349094672&doi=10.1109%2f3DIM.2007.15&partnerID=40&md5=8600e1f920f36e80e7bf4d85adbba783 | |
dc.description.startpage | 419 | |
dc.description.endpage | 426 | |
dc.publisher.place | Montreal, QC | |
dcterms.isPartOf.abbreviation | 3DIM - Proc. Int. Conf. 3-D Digit. Imaging Model. | |
crisitem.author.netid | HeJo177 | - |
Seitenaufrufe
6
Letzte Woche
0
0
Letzter Monat
4
4
geprüft am 19.05.2024