By Topic

Finding cylinders in range data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lozano-Perez, T. ; MIT Artificial Intelligence Laboratory, Cambridge, MA, USA ; Grimson, W. ; White, S.

We have investigated the problem of locating cylinders in a depth scan map. The crucial problem is deciding whether a group of scans could arise from the same cylinder. We investigated a number of traditional approaches to this problem. We found significant reliability and accuracy problems in the traditional approaches that involve fitting ellipses to the scan data. As an alternative, we have developed a simple and very robust method for computing the axis of a cylinder based on three scans. This computation provides the basic capability needed to segment the scan data. This report summarizes our experience with several of the methods and describes the new method in detail.

Published in:

Robotics and Automation. Proceedings. 1987 IEEE International Conference on  (Volume:4 )

Date of Conference:

Mar 1987