Direct construction of the perspective projection aspect graph of convex polyhedra

The aspect graph concept was first described by Koenderink and van Doorn as a possible mechanism in human vision and has subsequently become an active research topic in computer vision. This paper describes an algorithm for constructing the perspective projection aspect graph of convex polyhedra. In the perspective projection aspect graph, viewpoint space is modeled as all of 3D space surrounding the object. This makes the perspective projection aspect graph a more realistic representation than the orthographic projection aspect graph , in which viewpoint space is modeled by the Gaussian sphere. The algorithm uses an intermediate data structure which represents a complete parcellation of 3D space derived from the geometric definition of the object. All information necessary for identifying object aspects and corresponding viewing cells is obtained as a result of this parcellation. The resulting aspect graph structure has a node for each distinct aspect/viewing cell. The upper bounds on the time complexity of the algorithm and the space complexity of the resulting data structure are Θ( N 4 ), where N is the number of faces of the polyhedron. The algorithm has been implemented in C, runs on a SUN workstation, and can use PADL-2 files for its input description of objects.

[1]  Louise Stark,et al.  Developing the aspect graph representation for use in image understanding , 1989 .

[2]  Thomas C. Henderson,et al.  CAGD-Based Computer Vision , 1988, Defense, Security, and Sensing.

[3]  Jitendra Malik,et al.  Computing the aspect graph for line drawings of polyhedral objects , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[4]  Chris Goad,et al.  Automatic Construction of Special Purpose Programs , 1982, CADE.

[5]  Linda G. Shapiro.  A CAD-Model-Based System For Object Localization , 1988, Defense, Security, and Sensing.

[6]  Chris Goad,et al.  Special purpose automatic programming for 3D model-based vision , 1987 .

[7]  D. Kriegman,et al.  On recognizing and positioning curved 3D objects from image contours , 1989, [1989] Proceedings. Workshop on Interpretation of 3D Scenes.

[8]  Kevin W. Bowyer,et al.  Implementing Viewing Spheres: Automatic Construction Of Aspect Graphs For Planar-Faced, Convex Objects , 1987, Other Conferences.

[9]  K. S. Miller,et al.  An Introduction to the Calculus of Finite Differences and Difference Equations. , 1960 .

[10]  Precompiling a Geometrical Model into an Interpretation Tree for Object Recognition in Bin-picking Tasks , 1987 .

[11]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[12]  Charles R. Dyer,et al.  3-D multiview object representations for model-based object recognition , 1987, Pattern Recognit..

[13]  E. N.,et al.  The Calculus of Finite Differences , 1934, Nature.

[14]  Nancy A. Watts.  Calculating the principal views of a polyhedron , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[15]  J. Brian Burns,et al.  Recognition in 2D Images of 3D Objects from Large Model Bases Using Prediction Hierarchies , 1987, IJCAI.

[16]  Michael Werman,et al.  The visual potential: One convex polygon , 1989, Comput. Vis. Graph. Image Process..

[17]  Kevin W. Bowyer,et al.  Aspect Graphs And Nonlinear Optimization In 3-D Object Recognition , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[18]  David J. Kriegman,et al.  On Recognizing and Positioning Curved 3-D Objects from Image Contours , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Charles R. Dyer,et al.  An algorithm for constructing the aspect graph , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).