Share Email Print

Proceedings Paper

Locating Known Objects In 3-D From A Single Perspective View
Author(s): William J. Wolfe; Cheryl Weber-Sklair; Donald Mathis; Michael Magee
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Determining the 3-D location of an object from image-derived features, such as edges and vertices, has been a central problem for the computer vision industry since its inception. This paper reports on the use of four coplanar points (in particular, a rectangle) and three points for determining 3-D object position from a single perspective view. The four-point algorithm of Hung and Yeh is compared to the four-point algorithm of Haralick. Both methods uniquely solve the inverse perspective problem, but in different ways. The use of three points has proven to be more difficult, mainly because of multiple solutions to the inverse perspective problem as pointed out by Fischler and Bolles. This paper also presents computer simulation results that demonstrate the spatial constraints associated with these multiple solutions. These results provide the basis for discarding spurious solutions when some prior knowledge of configuration is available. Finally, the use of vertex-pairs introduced by Thompson and Mundy is analyzed and compared to the other method.

Paper Details

Date Published: 27 March 1989
PDF: 17 pages
Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960316
Show Author Affiliations
William J. Wolfe, University of Colorado at Denver (United States)
Cheryl Weber-Sklair, Martin Marietta Astronautics Group (United States)
Donald Mathis, Martin Marietta Astronautics Group (United States)
Michael Magee, University of Wyoming (United States)

Published in SPIE Proceedings Vol. 1002:
Intelligent Robots and Computer Vision VII
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?