Aisberg: dal 2009 è l'archivio ad accesso aperto dell'Università di Bergamo; dal 2011 è anche l'anagrafe della ricerca di Ateneo.
L'archivio è un'implementazione di IRIS, il sistema informativo per la ricerca sviluppato da Cineca.
EnglishThe Iterative Closest Point (ICP) Algorithm is one of the most popular approaches to shape registration currently in use. At the core of ICP is the computationally-intensive determination of nearest neighbors (NN). As of now there has been no comprehensive analysis of competing search strategies for NN. This paper compares several libraries for nearest neighbor search (NNS) on both simulated and real data with a focus on shape registration. In addition, we present a novel efficient implementation of NNS via k-d trees as well as a novel algorithm for NNS in octrees.
| Titolo: | Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration |
| Tutti gli autori: | Elseberg, Jan; Magnenat, Stephane; Siegwart, Roland; Nuechter, Andreas |
| Data di pubblicazione: | mar-2012 |
| Abstract (eng): | The Iterative Closest Point (ICP) Algorithm is one of the most popular approaches to shape registration currently in use. At the core of ICP is the computationally-intensive determination of nearest neighbors (NN). As of now there has been no comprehensive analysis of competing search strategies for NN. This paper compares several libraries for nearest neighbor search (NNS) on both simulated and real data with a focus on shape registration. In addition, we present a novel efficient implementation of NNS via k-d trees as well as a novel algorithm for NNS in octrees. |
| Nelle collezioni: | JOSER Archive - Archivio della rivista JOSER |
File allegato/i alla scheda:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| 50-228-1-PB.pdf | publisher's version - versione editoriale |  | Open AccessVisualizza/Apri |
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo
Copyright © 2019