Computing the Aspect Graph for Line Drawings of Polyhedral Objects

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 12, Issue 2, 1990, Pages 113-122

  Gigus, Ziv ^a   Malik, Jitendra ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Aspect graphs; line drawing interpretation; model based vision; object recognition; polyhedral objects

Indexed keywords

IMAGE PROCESSING--IMAGE ANALYSIS; PATTERN RECOGNITION; SURFACES;

ASPECT GRAPH; LINE DRAWING INTERPRETATION; MODEL BASED VISION; OBJECT RECOGNITION; OPAQUE OBJECT; POLYHEDRAL OBJECTS;

VISION;

EID: 0025387820     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.44399     Document Type: Article

References (22)

1. V. I. Arnol’d, “Indices of singular points of 1-forms on a manifold with boundary, convolutions of invariants of reflection groups, and singular projections of smooth surfaces,” Russian Math. Surveys, vol. 34, no. 2, pp. 1–42, 1979.
2. “Singularities of systems of rays,” Russian Math. Surveys, vol. 38, no. 2, pp. 87–176, 1983.
3. P. J. Best and R. C. Jain, “Three-dimensional object recognition,” ACM Comput. Surveys, vol. 17, no. 1, pp. 75–145, Mar. 1985.
4. R. T. Chin and C. R. Dyer, “Model-based recognition in robot vision,” ACM Comput. Surveys, vol. 18, no. 1, pp. 67–108, Mar. 1986.
5. I. Chakravarty and H. Freeman, “Characteristic views as a basis for three-dimensional object recognition,” in Proc. Soc. Photo-Optical Instrumentation Engineers Conf. Robot Vision, vol. 336, SPIE, Bellingham, WA, 1982.
6. J. Callahan and R. Weiss, “A model for describing surface shape,” in Proc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, 1985, pp. 240–245.
7. G. Fekete and L. S. Davis, “Property spheres: A new representation for 3-d recognition,” in Proc. IEEE Workshop Computer Vision: Representation and Control, IEEE, 1984, pp. 192–201.
8. Z. Gigus, J. F. Canny, and R. Seidel, “Efficiently computing the aspect graph of polyhedral objects,” in Proc. Second Int. Conf. Computer Vision, IEEE, Dec. 1988, pp. 30–39.
9. Z. Gigus and J. Malik, “Computing the viewing data for polyhedral objects,” in Proc. 1988 IEEE Int. Conf. Robotics and Automation, IEEE, Apr. 1988, pp. 1560–1566.
10. C. Goad, “Special purpose automatic programming for 3d model-based vision,” in Proc. DARPA Image Understanding Workshop, June 1983, pp. 94–104.
11. M. Hebert and T. Kanade, “The 3d-profile method for object recognition,” in Proc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, June 1985, pp. 458–463.
12. K. Ikeuchi, “Precompiling a geometrical model into an interpretation tree for object recognition in bin-picking tasks,” in Proc. DARPA Image Understanding Workshop, Feb. 1987, pp. 321–339.
13. Y. L. Kergosien, “La famille des projections orthogonales d’une surface et ses singularités,” C. R. Acad. Sci. Paris, vol. 292, pp. 929–932, 1981.
14. J. J. Koenderink and A. J. van Doorn, “The singularities of visual mapping,” Biol. Cybern., vol. 24, pp. 51–59, 1976.
15. “The internal representation of solid shape with respect to vision,” Biol. Cybern., vol. 32, pp. 211–216, 1979.
16. W. H. Plantinga and C. R. Dyer, “An algorithm for constructing the aspect graph,” in Proc. 27th Symp. Foundations of Computer Science, IEEE, 1986, pp. 123–131.
17. “Visibility, occlusion and the aspect graph,” Univ. Wisconsin—Madison, Tech. Rep. 736, Dec. 1987.
18. W. H. Plantinga, “The Asp: A continuous, viewer-centered object representation for computer vision,” Ph.D. dissertation, Univ. Wisconsin-Madison, Aug. 1988; also published as Comput. Sci. Tech. Rep. 784.
19. J. H. Rieger, “On the classification of views of piecewise smooth objects,” Image and Vision Comput., vol. 5, no. 2, pp. 91–97, May 1987.
20. G. Salmon, Analytic Geometry of Three Dimensions. Cambridge, England: Metcalfe, 1874.
21. J. Stewman and K. Bowyer, “Aspect graphs for convex planar-face objects,” in Proc. IEEE Comput. Soc. Workshop Computer Vision, IEEE, Dec. 1987, pp. 123–130.
22. M. Warman, S. Baugher, and J. A. Gualtieri, “The visual potential: One convex polygon,” Center for Automation Research, Univ. Maryland, College Park, Tech. Rep. CAR-TR-212, Aug. 1986.