SwePub
Tyck till om SwePub Sök här!
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Magnusson Martin Docent 1977 )
 

Sökning: WFRF:(Magnusson Martin Docent 1977 ) > Revisiting Distribu...

Revisiting Distribution-Based Registration Methods

Gupta, Himanshu, 1993- (författare)
Örebro universitet,Institutionen för naturvetenskap och teknik,Centre for Applied Autonomous Sensor Systems (AASS)
Andreasson, Henrik, 1977- (författare)
Örebro universitet,Institutionen för naturvetenskap och teknik,Centre for Applied Autonomous Sensor Systems (AASS)
Magnusson, Martin, Docent, 1977- (författare)
Örebro universitet,Institutionen för naturvetenskap och teknik,Centre for Applied Autonomous Sensor Systems (AASS)
visa fler...
Julier, Simon (författare)
Department of Computer Science, University College London, London, England
Lilienthal, Achim J., 1970- (författare)
Örebro universitet,Institutionen för naturvetenskap och teknik,Perception for Intelligent Systems, Technical University of Munich, Germany,Centre for Applied Autonomous Sensor Systems (AASS)
visa färre...
 (creator_code:org_t)
IEEE, 2023
2023
Engelska.
Ingår i: 2023 European Conference on Mobile Robots (ECMR). - : IEEE. - 9798350307047 - 9798350307054 ; , s. 43-48
  • Konferensbidrag (refereegranskat)
Abstract Ämnesord
Stäng  
  • Normal Distribution Transformation (NDT) registration is a fast, learning-free point cloud registration algorithm that works well in diverse environments. It uses the compact NDT representation to represent point clouds or maps as a spatial probability function that models the occupancy likelihood in an environment. However, because of the grid discretization in NDT maps, the global minima of the registration cost function do not always correlate to ground truth, particularly for rotational alignment. In this study, we examined the NDT registration cost function in-depth. We evaluated three modifications (Student-t likelihood function, inflated covariance/heavily broadened likelihood curve, and overlapping grid cells) that aim to reduce the negative impact of discretization in classical NDT registration. The first NDT modification improves likelihood estimates for matching the distributions of small population sizes; the second modification reduces discretization artifacts by broadening the likelihood tails through covariance inflation; and the third modification achieves continuity by creating the NDT representations with overlapping grid cells (without increasing the total number of cells). We used the Pomerleau Dataset evaluation protocol for our experiments and found significant improvements compared to the classic NDT D2D registration approach (27.7% success rate) using the registration cost functions "heavily broadened likelihood NDT" (HBL-NDT) (34.7% success rate) and "overlapping grid cells NDT" (OGC-NDT) (33.5% success rate). However, we could not observe a consistent improvement using the Student-t likelihood-based registration cost function (22.2% success rate) over the NDT P2D registration cost function (23.7% success rate). A comparative analysis with other state-of-art registration algorithms is also presented in this work. We found that HBL-NDT worked best for easy initial pose difficulties scenarios making it suitable for consecutive point cloud registration in SLAM application.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)

Publikations- och innehållstyp

ref (ämneskategori)
kon (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy