2018 IEEE International Conference on Robotics and Automation (ICRA) 2018
DOI: 10.1109/icra.2018.8461063
|View full text |Cite
|
Sign up to set email alerts
|

AA-ICP: Iterative Closest Point with Anderson Acceleration

Abstract: Iterative Closest Point (ICP) is a widely used method for performing scan-matching and registration. Being simple and robust method, it is still computationally expensive and may be challenging to use in real-time applications with limited resources on mobile platforms. In this paper we propose novel effective method for acceleration of ICP which does not require substantial modifications to the existing code.This method is based on an idea of Anderson acceleration which is an iterative procedure for finding a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 90 publications
(57 citation statements)
references
References 17 publications
0
54
0
Order By: Relevance
“…Baseline Algorithms We present extensive performance evaluation by comparing with a few point cloud registration algorithms based on geometry. They are: (i) The ICP family, such as ICP [2], G-ICP [28], and AA-ICP [21]; (ii) NDT-P2D [30]; (iii) GMM family, such as GMM-REG [15] and CPD [19]. The implementations of ICP, G-ICP, AA-ICP, and NDT-P2D are from the Point Cloud Library (PCL) [26].…”
Section: Performancementioning
confidence: 99%
“…Baseline Algorithms We present extensive performance evaluation by comparing with a few point cloud registration algorithms based on geometry. They are: (i) The ICP family, such as ICP [2], G-ICP [28], and AA-ICP [21]; (ii) NDT-P2D [30]; (iii) GMM family, such as GMM-REG [15] and CPD [19]. The implementations of ICP, G-ICP, AA-ICP, and NDT-P2D are from the Point Cloud Library (PCL) [26].…”
Section: Performancementioning
confidence: 99%
“…However, its long computational time and need for an inclusion relationship for two-point clouds [5] seriously affects the performance of the ICP algorithm. Hence, many experts and scholars have proposed many approaches to improve the algorithm [6][7][8]. Because of this limitation of the algorithm, ICP and its variants need good initialization to avoid falling into a local minimum.…”
Section: Related Workmentioning
confidence: 99%
“…The most popular method in local registration is Iterative Closest Point (Besl, McKay, 1992, Chen, Medioni, 1992) and a lot of variants exist (Chen, Medioni, 1992, Rusinkiewicz, Levoy, 2001, Pavlov et al, 2017, Chetverikov et al, 2002. For example, (Babin et al, 2019) compares different cost functions, in order to make ICP robust to outliers.…”
Section: Local Registrationmentioning
confidence: 99%