Till Örebro universitet

oru.seÖrebro universitets publikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Beyond points: Evaluating recent 3D scan-matching algorithms
Örebro universitet, Institutionen för naturvetenskap och teknik. (AASS MRO Lab)ORCID-id: 0000-0001-8658-2985
Deptartment of EECS, Jacobs University, Bremen, Germany.
Örebro universitet, Institutionen för naturvetenskap och teknik. (AASS MRO Lab)ORCID-id: 0000-0002-6013-4874
Deptartment of EECS, Jacobs University, Bremen, Germany.
Visa övriga samt affilieringar
2015 (Engelska)Ingår i: 2015 IEEE International Conference on Robotics and Automation (ICRA), IEEE conference proceedings , 2015, Vol. 2015 June, s. 3631-3637Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Given that 3D scan matching is such a central part of the perception pipeline for robots, thorough and large-scale investigations of scan matching performance are still surprisingly few. A crucial part of the scientific method is to perform experiments that can be replicated by other researchers in order to compare different results. In light of this fact, this paper presents a thorough comparison of 3D scan registration algorithms using a recently published benchmark protocol which makes use of a publicly available challenging data set that covers a wide range of environments. In particular, we evaluate two types of recent 3D registration algorithms - one local and one global. Both approaches take local surface structure into account, rather than matching individual points. After well over 100 000 individual tests, we conclude that algorithms using the normal distributions transform (NDT) provides accurate results compared to a modern implementation of the iterative closest point (ICP) method, when faced with scan data that has little overlap and weak geometric structure. We also demonstrate that the minimally uncertain maximum consensus (MUMC) algorithm provides accurate results in structured environments without needing an initial guess, and that it provides useful measures to detect whether it has succeeded or not. We also propose two amendments to the experimental protocol, in order to provide more valuable results in future implementations.

Ort, förlag, år, upplaga, sidor
IEEE conference proceedings , 2015. Vol. 2015 June, s. 3631-3637
Serie
Proceedings - IEEE International Conference on Robotics and Automation, ISSN 1050-4729 ; 2015-June
Nyckelord [en]
Normal distribution, robot vision, 3D scan registration algorithm, 3D scan-matching algorithm, ICP method, MUMC algorithm, NDT, benchmark protocol, iterative closest point method, large-scale investigation, local surface structure, minimally uncertain maximum consensus algorithm, normal distribution transform, robot, Benchmark testing, Gaussian distribution, Iterative closest point algorithm, Optimization, Protocols, Three-dimensional displays, Transforms
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
URN: urn:nbn:se:oru:diva-45597DOI: 10.1109/ICRA.2015.7139703ISI: 000370974903093Scopus ID: 2-s2.0-84938280438ISBN: 978-1-4799-6923-4 (tryckt)OAI: oai:DiVA.org:oru-45597DiVA, id: diva2:847086
Konferens
2015 IEEE International Conference on Robotics and Automation (ICRA), Seattle, USA, May 26-30, 2015
Projekt
ALLOSPENCERRobLog
Forskningsfinansiär
KK-stiftelsen, 20110214EU, FP7, Sjunde ramprogrammet, ICT-2011-600877EU, FP7, Sjunde ramprogrammet, ICT-270350Tillgänglig från: 2015-08-19 Skapad: 2015-08-19 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

fulltext(842 kB)1482 nedladdningar
Filinformation
Filnamn FULLTEXT02.pdfFilstorlek 842 kBChecksumma SHA-512
cfcbb17c7106c34a6deed37402bedb054e7fbb67b0dfcd03132a3b3e962d752f30fc2931e4f6c4147ca401d3b0c3084eb313e4154cf313284f9128d02da97998
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopus

Person

Magnusson, MartinStoyanov, Todor

Sök vidare i DiVA

Av författaren/redaktören
Magnusson, MartinStoyanov, Todor
Av organisationen
Institutionen för naturvetenskap och teknik
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 1482 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 936 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf