Share Email Print

Proceedings Paper

Parallel Fitting Of Quadric Patches For Structural Analysis Of Range Imagery
Author(s): A. Perez; M. A. Abidi; R. C. Gonzalez
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Surface fitting allows for pose estimation and recognition of objects in range scenes. Unfortunately, surface fitting is computation-intensive. One way to speed-up this task is to use parallel processing, since its availability is on the increase. Mathematically, surface fitting can be formulated as an overdetermined linear system which can be solved in the least-square sense. Because of numerical stability and ease of implementation, the QR-factorization using the Givens transformation is best suited for the parallel solution of overdetermined systems. In this paper we present two algorithms to carry out a QR factorization on both distributed-memory and shared-memory parallel computers. These algorithms have been implemented and evaluated in terms of speed-up time.

Paper Details

Date Published: 13 October 1987
PDF: 8 pages
Proc. SPIE 0845, Visual Communications and Image Processing II, (13 October 1987); doi: 10.1117/12.976490
Show Author Affiliations
A. Perez, University of Tennessee (United States)
M. A. Abidi, University of Tennessee (United States)
R. C. Gonzalez, University of Tennessee and Perceptics Corporation (United States)

Published in SPIE Proceedings Vol. 0845:
Visual Communications and Image Processing II
T. Russell Hsing, Editor(s)

© SPIE. Terms of Use
Back to Top