RANSAC Matching: Simultaneous Registration and Segmentation

被引:20
作者
Yang, Shao-Wen [1 ]
Wang, Chieh-Chih [1 ]
Chang, Chun-Hua [1 ]
机构
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10617, Taiwan
来源
2010 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA) | 2010年
关键词
D O I
10.1109/ROBOT.2010.5509809
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample consensus (RANSAC) based algorithm to simultaneously achieving robust and realtime ego-motion estimation, and multi-scale segmentation in environments with rapid changes. Instead of directly sampling on measurements, RANSAC matching investigates initial estimates at the object level of abstraction for systematic sampling and computational efficiency. A soft segmentation method using a multi-scale representation is exploited to eliminate segmentation errors. By explicitly taking into account the various noise sources degrading the effectiveness of geometric alignment: sensor noise, dynamic objects and data association uncertainty, the uncertainty of a relative pose estimate is calculated under a theoretical investigation of scoring in the RANSAC paradigm. The improved segmentation can also be used as the basis for higher level scene understanding. The effectiveness of our approach is demonstrated qualitatively and quantitatively through extensive experiments using real data.
引用
收藏
页码:1905 / 1912
页数:8
相关论文
共 24 条