Share Email Print
cover

Proceedings Paper

Finding cones from multiscan range maps
Author(s): Shao Lejun; Richard A. Volz
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Two algorithms are presented to locate a cone with a known shape from a range scan map. They are ellipse fitting and three-scan methods. The localization problem includes the finding of both cone's orientation and displacement relative to the sensing coordinate system. The work described in this paper is an extension to the problem of extracting the cylinder parameters from a depth scan map. The range data are obtained from either a light-stripe based range sensor or a line range sensor, which measures the distance between the sensor and the nearest points on the intersection of the light plane and the scene. The three-scan method uses range data from three scan lines of measurements. It does not use any ellipse fitting. This method first extracts the orientation parameters of at least three cone's generators and then derive the axis direction vector from the cone's generators. The performance of this method is compared with the usual ellipse fitting method.

Paper Details

Date Published: 1 March 1992
PDF: 7 pages
Proc. SPIE 1608, Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods, (1 March 1992); doi: 10.1117/12.135104
Show Author Affiliations
Shao Lejun, Nanyang Technological Univ. (Singapore)
Richard A. Volz, Texas A&M Univ. (United States)


Published in SPIE Proceedings Vol. 1608:
Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top