ICRA'09 Paper Abstract


Paper FrC3.2

Klasing, Klaas (Technische Universität München), Wollherr, Dirk (Technische Universität München), Buss, Martin (Technische Universität München)

Realtime Segmentation of Range Data Using Continuous Nearest Neighbors

Scheduled for presentation during the Regular Sessions "Range Sensing - I" (FrC3), Friday, May 15, 2009, 13:50−14:10, Room: 401

2009 IEEE International Conference on Robotics and Automation, May 12 - 17, 2009, Kobe, Japan

This information is tentative and subject to change. Compiled on January 21, 2022

Keywords Recognition, Range Sensing, Autonomous Agents


In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realtime segmentation of a continuous stream of incoming range data. The method is an extension of the previously developed RBNN algorithm and proceeds in two phases: Firstly, the normal vector of each incoming point is estimated from its neighborhood, which is continuously monitored. Secondly, new points are clustered according to their Euclidean and angular distance to previously clustered points. An outline of the algorithm complexity as well as the parameters that influence the segmentation performance is provided. Three benchmark scenarios in which the algorithm is deployed on a mobile robot with a laser range finder confirm that the method can robustly segment incoming data at high rates.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2022 PaperCept, Inc.
Page generated 2022-01-21  09:00:04 PST  Terms of use