A System for Stereo Computer Vision with Geometric Models
Proceedings of the Fifth International Joint Conference on Artificial Intelligence. Vision. Pages 583--1.
© 1977 International Joint Conferences on Artificial Intelligence
Abstract
- Burr, D. J. and R. T. Chien, "The Minimal Spanning Tree in Visual Data Segmentation," Proc. 3rd IJCPR, San Diego, California, Nov., 1976.
- Chien,R. T. and L. J. Peterson, "Image Compres- sion by Feature Extraction and Reconstruction," Proc. Workshop on Picture Data Description and Management, Chicago, Ill., April 21-22, 1977.
- Duda, R. 0. and P. E. Hart, Pattern Classification ~ ~ Analysis, p. 338, John Wiley and .Sons, New York, 1973.
- Hannah, M. J., "Computer Matching of Areas in Stereo Images," Stanford AI Memo AIM-239, Stanford University, July, 1974.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
A SYSTEM ~OR STEREO COMPUTER VISION WITH GEOMETRIC MODELS*
D. J. Burr and R. T. Chien Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, Illinois 60801
The goal of this work is the specification of a system which extracts 3-D features from images by stereo comparison, and which recognizes objects by comparing these features to geometric models of objects. Models are encoded from hand measurements and consist of piecewise-linear wire frame structures. The work is in progress and some partial results are shown.
Bulk correlation methods [4] are used with three images of a scene to insure accurate triangulation for smooth directed edges. The following pictures are obtained: 1. center. 2. scene rotated 20° east. 3. scene rotated 10° north. The program compares center and east pictures for vertical edges and center and north pictures for horizontal edges.
Edge orientation is computed after preprocessing the center picture to find edge chains. An operator developed by Burr [1,2] finds local gradient extrema and tracks them by searching near neighbors ( ~ig. 1 a). These chains are approximated by line segments [3] in Fig. 1b. The edge direction at a node, or line end, is taken as the average of the line direction on each side weighted by its length.
Stereo correlation is implemented as a mean-square difference of image intensity over 9 x 9 pixel windows. Search for the m1n1mum in the corresponding view is restricted to a single line segment [4], and further, to locations where the intensity gradient exceeds a threshold. Triangulation determines a 3-D location for each node of Fig. 1b. A separate program attempts to match this 3-D structure . (Fig. 2a) to a model.
Model matching proceeds in two steps as follows: ( 1) A search is made to find a model edge and perceived edge whose lengths agree. If found, each defines the z-axis of a cylindrical coordinate system (r, 8 ,z). The rotational, or e -ambiguity, is relieved by finding an additional edge pair which have nea~lyAe~ual lengths, center positions (rc,zc), and (r, e ,z) direction cosines. The position of this feature relative to each z-axis now defines the y-axis direction of a cartesian reference frame for both model and perceived structure. The x-axes are just Y x Z.
- There may be further implied edge matches due to similarity of x-y-z edge coordinates and directions relative to each reference frame. An attempt is made to measure the confidence of this coordinate transformation by finding these implied edge matches. The criterion for an edge match is -- perceived edge length ~ model edge length,
- *This work was supported by the Joint Services Electronics Program (U.S. Army, U.S. Navy, and U.S. Air Force) under Contract DAAB-07-72-C-0259.
perceived edge center lies within a tolerance cylinder about the model edge, and direction cosines agree. The confidence is thus the total length of all matched edges divided by the total length of all scene edges. If this confidence exceeds the last computed value then it becomes the new threshold, and subseauent proposals must either exceed it or be rejected. The match of highest confidence is taken as the correct one, and the model is rotated and projected into the center view for observation (~ig. 2b).
Further work is being done on efficient tracking of 3-D edges and piecewise circular representations for 3-D edges. The ultimate goal is automatic identification of an object in an occluded scene from a model data base.


a.
b.


a.
b.
Figure 2. a. Rotated view of Fig. 1b after 3-D computation and removal of highly sloped depth edges. b. Best match of car model to 3-D scene (confidence=0.713, PDP-10 run time=13 sec.).
@inproceedings{ijcai1977p132,
title = {A System for Stereo Computer Vision with Geometric Models},
author = {Burr, D. J. and Chien, Robert T.},
booktitle = {Proceedings of the Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-77}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Raj Reddy},
pages = {583---1},
year = {1977},
note = {Vision},
url = {https://ijcai.org/proceedings/1977/132},
}
TY - CPAPER TI - A System for Stereo Computer Vision with Geometric Models AU - Burr, D. J. AU - Chien, Robert T. T2 - Proceedings of the Fifth International Joint Conference on Artificial Intelligence, IJCAI-77 PB - International Joint Conferences on Artificial Intelligence PY - 1977 SP - 583 EP - -1 UR - https://ijcai.org/proceedings/1977/132 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
Welcome
Future Conferences
AI Journal Division
IJCAI Proceedings
About IJCAI
IJCAI Awards