
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Z. Gigus, J. Malik, "Computing the Aspect Graph for Line Drawings of Polyhedral Objects," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 2, pp. 113122, February, 1990.  
BibTex  x  
@article{ 10.1109/34.44399, author = {Z. Gigus and J. Malik}, title = {Computing the Aspect Graph for Line Drawings of Polyhedral Objects}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {2}, issn = {01628828}, year = {1990}, pages = {113122}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.44399}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Computing the Aspect Graph for Line Drawings of Polyhedral Objects IS  2 SN  01628828 SP113 EP122 EPD  113122 A1  Z. Gigus, A1  J. Malik, PY  1990 KW  3D object representation; picture processing; edge projection; pattern recognition; aspect graph; line drawings; polyhedral objects; Gaussian sphere; accidental viewpoints; vertex; geometry; computational geometry; graph theory; pattern recognition; picture processing VL  12 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
An algorithm for computing the aspect graph for polyhedral objects is described. The aspects graph is a representation of threedimensional objects by a set of twodimensional views. The set of viewpoints on the Gaussian sphere is partitioned into regions such that in each region the qualitative structure of the line drawing remains the same. At the boundaries between adjacent regions are the accidental viewpoints where the structure for the line drawing changes. It is shown that for polyhedral objects there are two fundamental visual events: (1) the projections of an edge and a vertex coincide; and (2) the projections of three nonadjacent edges intersect at a point. The geometry of the object is reflected in the locus of the accidental viewpoints. The algorithm computes the partition together with a representative view for each region of the partition.
[1] V. I. Arnol'd, "Indices of singular points of 1forms 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. 142, 1979.
[2] V. I. Arnol'd, "Singularities of systems of rays,"Russian Math. Surveys, vol. 38, no. 2, pp. 87176, 1983.
[3] P. J. Besl and R. C. Jain, "Threedimensional object recognition,"ACM Comput. Surveys, vol. 17, no. 1, pp. 75145, Mar. 1985.
[4] R.T. Chin and C. R. Dyer, "Modelbased recognition in robot vision,"ACM Comput. Surveys, vol. 18, no. 1, pp. 67108, Mar. 1986.
[5] I. Chakravarty and H. Freeman, "Characteristic views as a basis for threedimensional object recognition," inProc. Soc. PhotoOptical Instrumentation Engineers Conf. Robot Vision, vol. 336, SPIE, Bellingham, WA, 1982.
[6] J. Callahan and R. Weiss, "A model for describing surface shape," inProc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, 1985, pp. 240245.
[7] G. Fekete and L. S. Davis, "Property spheres: A new representation for 3d recognition," inProc. IEEE Workshop Computer Vision: Representation and Control, IEEE, 1984, pp. 192201.
[8] Z. Gigus, J.F. Canny, and R. Seidel, "Efficiently computing and representing aspect graphs of polyhedral objects," inProc. Second Int. Conf. Computer Vision, IEEE, New York, Dec. 1988, pp. 3039.
[9] Z. Gigus and J. Malik, "Computing the aspect graph for line drawings of polyhedral objects," inProc. 1988 IEEE Int. Conf. Robotics and Automation, IEEE, New York, Apr. 1988, pp. 15601566.
[10] C. Goad, "Special purpose automatic programming for 3d modelbased vision," inProc. DARPA Image Understanding Workshop, June 1983, pp. 94104.
[11] M. Hebert and T. Kanade, "The 3dprofile method for object recognition," inProc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, June 1985, pp. 458463.
[12] K. Ikeuchi, "Precompiling a geometrical model into an interpretation tree for object recognition in binpicking tasks," inProc. DARPA Image Understanding Workshop, Feb. 1987, pp. 321339.
[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. 5159, 1976.
[15] J. J. Koenderink and A. J. van Doorn, "The internal representation of solid shape with respect to vision,"Biol. Cybern., vol. 32, pp. 211216, 1979.
[16] W. H. Plantinga and C. R. Dyer, "An algorithm for constructing the aspect graph," inProc. 27th Symp. Foundations of Computer Science, IEEE, 1986, pp. 123131.
[17] W. H. Plantinga and C. R. Dyer, "Visibility, occlusion and the aspect graph," Univ. WisconsinMadison, Tech. Rep. 736, Dec. 1987.
[18] W. H. Plantinga, "The Asp: A continuous, viewercentered object representation for computer vision," Ph.D. dissertation, Univ. WisconsinMadison, Aug. 1988; also published as Comput. Sci. Tech. Rep. 784.
[19] J.H. Rieger, "On the classification of views of piecewise smooth objects,"Image Vision Comput., vol. 5, no. 2, pp. 9197, May 1987.
[20] G. Salmon,Analytic Geometry of Three Dimensions. Cambridge, England: Metcalfe, 1874.
[21] J. Stewman and K. Bowyer, "Aspect graphs for convex planarface objects, " inProc. IEEE Comput. Soc. Workshop Computer Vision, IEEE, Dec. 1987, pp. 123130.
[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. CARTR212, Aug. 1986.