Fast range-independent spherical subsampling of 3D laser scanner points and data reduction performance evaluation for scene registration

被引:34
作者
Mandow, Anthony [1 ]
Martinez, Jorge L. [1 ]
Reina, Antonio J. [1 ]
Morales, Jesus [1 ]
机构
[1] Univ Malaga, Dept Ingn Sistemas & Automat, ETS Ingn Ind, E-29071 Malaga, Spain
关键词
3D measurement system; Laser ranging; Point subsampling; Scene registration; Mobile robotics; Point matching;
D O I
10.1016/j.patrec.2010.03.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Three-dimensional laser range-finders are increasingly being incorporated into applications, such as mobile robotics, that require real-time registration of scene data. However, the computational costs of adaptive range-dependent data selection and point cloud matching grow significantly with the number of points. Therefore, fast range-independent subsampling by uniform or random data reduction is usually performed at a preprocessing step. The paper proposes a new range-independent subsampling algorithm that is more effective for the widely used spherical scanning mechanism. As this type of device measures the ranges by composition of two rotations, it samples certain directions with a higher density, which can distort the registration optimization process. The proposed solution uses sensor characteristics to equalize the measure-direction density of the reduced point cloud. The paper also addresses performance assessment of subsampling methods by contributing three benchmark criteria that do not rely on a particular registration technique: one considers the ground truth transformation between two scans, and the other two are based on the analysis of a single scan. The advantages of spherical subsampling are analyzed through a comparison of range-independent methods and a simple range-dependent one with real scans from three representative scenes (urban, natural, and indoors). (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1239 / 1250
页数:12
相关论文
共 28 条
[1]  
ANDREASSON H, 2007, P IEEE RSJ INT C INT, P3429
[2]  
[Anonymous], 1658 INRIA
[3]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[4]   REGISTERING MULTIVIEW RANGE DATA TO CREATE 3D COMPUTER OBJECTS [J].
BLAIS, G ;
LEVINE, MD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (08) :820-824
[5]  
Brujic D, 1996, INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL II, P393, DOI 10.1109/ICIP.1996.560844
[6]   3D free-form object recognition in range images using local surface patches [J].
Chen, Hui ;
Bhanu, Bir .
PATTERN RECOGNITION LETTERS, 2007, 28 (10) :1252-1262
[7]  
COLE DM, 2005, P IEEE WORKSH SLAM C
[8]   Geometrically stable sampling for the ICP algorithm [J].
Gelfand, N ;
Ikemoto, L ;
Rusinkiewicz, S ;
Levoy, M .
FOURTH INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS, 2003, :260-267
[9]  
GLENNIE C, 2007, INSIDEGNSS, V2, P22
[10]   Multi-robot mapping using manifold representations [J].
Howard, A .
2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, :4198-4203