稳健性(进化)
概率逻辑
迭代最近点
离群值
算法
计算机科学
平面的
统计模型
平面(几何)
噪音(视频)
点(几何)
人工智能
数学
点云
几何学
生物化学
化学
计算机图形学(图像)
图像(数学)
基因
作者
A. Segal,D. Haehnel,Sebastian Thrun
标识
DOI:10.15607/rss.2009.v.021
摘要
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 improvement, the proposed model allows for more expressive probabilistic models to be incorporated into the ICP framework.While maintaining the speed and simplicity of ICP, the Generalized-ICP could also allow for the addition of outlier terms, measurement noise, and other probabilistic techniques to increase robustness.
科研通智能强力驱动
Strongly Powered by AbleSci AI