Home/Finding Organized Structures in 3-D LADAR Data

Finding Organized Structures in 3-D LADAR Data

Nicolas Vandapel and Martial Hebert
Carnegie Mellon University, Army Science Conference, November, 2004

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

In this paper, we address the problem of finding concertina wire in three-dimensional (3-D) data. Wire entanglements constitute a major obstacle to the mobility of Unmanned Ground Vehicle because of their widespread use and the difficulty to detect them. We pose the problem in term of finding thin structures organized in complex patterns. Such problem did not received as much attention as linear and planar structures segmentation. We are interested especially in the problems posed by repetitive and symmetric structures acquired with a laser range finder. The method relies on 3-D data projections along specific directions and 2-D histograms comparison. The sensitivity of the classification algorithm to the parameter settings is evaluated and a segmentation method proposed. This paper is an extended version of our IROS 2004 paper.

BibTeX Reference
@conference{Vandapel-2004-9067,
title = {Finding Organized Structures in 3-D LADAR Data},
author = {Nicolas Vandapel and Martial Hebert},
booktitle = {Army Science Conference},
sponsor = {US Army Research Laboratory},
school = {Robotics Institute , Carnegie Mellon University},
month = {November},
year = {2004},
address = {Pittsburgh, PA},
}
2017-09-13T10:43:44+00:00