articleJun 28, 2009GOLD OA

Generalized-ICP

Stanford University

Indexed incrossref

Abstract

In this paper we combine the Iterative Closest Point ('ICP') and 'point-to-plane ICP' algorithms into a single probabilistic framework. We then use this framework to model locally planar surface structure from both scans instead of just the "model" scan as is typically done with the point-to-plane method. This can be thought of as 'plane-to-plane'. The new approach is tested with both simulated and real-world data and is shown to outperform both standard ICP and point-to-plane. Furthermore, the new approach is shown to be more robust to incorrect correspondences, and thus makes it easier to tune the maximum match distance parameter present in most variants of ICP. In addition to the demonstrated performance…

Citation impact

1,416
total citations
FWCI
10.18
Percentile
100%
References
21
Citations per year

Authors

3

Topics & keywords

Keywords
  • Robustness (evolution)
  • Probabilistic logic
  • Iterative closest point
  • Outlier
  • Algorithm
  • Computer science
  • Planar
  • Statistical model
No related works found for this paper.

Funding