Share Email Print

Proceedings Paper

Parallel range data processing: a real case study
Author(s): John C. Sluder; Mongi A. Abidi
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

In this paper, we begin by describing a range image processing method developed to allow an autonomous robot to detect and locate objects. The procedure consists of taking a range image, filtering and preprocessing the image, calculating surface normals, obtaining edge maps from both range and surface normals, combining the edge maps into an initial scene segmentation map, and analyzing each object in the scene in order to detect and locate the desired objects. While this method is reasonably fast and robust, its surface characterization is fairly crude. More elaborate surface characterization on a serial computer would be considerably slower, which is not desirable for autonomous robot operations. We then discuss the development of parallel techniques for surface characterization using range data. By using parallel processing, the complexity and accuracy of the characterization can be increased without an unacceptable cost in processing time. The method explored is a parallel implementation of a least squares QR surface fitting technique using Givens transformations. We conclude by summarizing the work done and briefly listing some future extensions of the current research.

Paper Details

Date Published: 1 March 1992
PDF: 14 pages
Proc. SPIE 1608, Intelligent Robots and Computer Vision X: Neural, Biological, and 3-D Methods, (1 March 1992); doi: 10.1117/12.135092
Show Author Affiliations
John C. Sluder, Univ. of Tennessee/Knoxville (United States)
Mongi A. Abidi, Univ. of Tennessee/Knoxville (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