Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 13, Issue 6, 1991, Pages 542-551

  Gigus, Ziv ^a   Canny, John ^a   Seidel, Raimund ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Aspect graphs line Drawing interpretation; model based vision object recognition persistent data structures polyhedral objects

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER VISION; DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

ASPECT GRAPHS; OBJECT RECOGNITION; ORTHOGRAPHIC PROJECTION; POLYHEDRAL OBJECTS;

IMAGE PROCESSING;

EID: 0026168867     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.87341     Document Type: Article

References (28)

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. V. I. Arnol’d, “Singularities of systems of rays,” Russian Math. Surveys, vol. 38, no. 2, pp. 87–176, 1983.
3. P. J. Besl and R. C. Jain, “Three-dimensional object recognition,” ACM 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 Eng. Conf. Robot Vision, vol. 336, SPIE, Bellingham, WA, 1982, pp. 37–45.
6. J. Callahan and R. Weiss, “A model for describing surface shape,” in Proc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, New York, 1985, pp. 240–245.
7. D. Eggert and K. Bowyer, “Computing orthographic projection aspect graph of solids of revolution,” in Proc. IEEE Workshop Interpretation of 3D Scenes, IEEE, New York, Nov. 1989, pp. 102–108.
8. Z. Gigus, J.F. Canny, and R. Seidel, “Efficiently computing and representing aspect graphs of polyhedral objects,” in Proc. Second Int. Vision, IEEE, New York, Dec. 1988, pp. 30–39.
9. Z. Gigus and J. Malik, “Computing the aspect graph for line drawings of polyhedral objects,” in Proc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, New York, June 1988, pp. 654–661.
10. Z. Gigus and J. Malik, “Computing the aspect graph for line drawings of polyhedral objects,” in Proc. 1988 IEEE Int. Conf. Robotics and Automation, IEEE, New York, Apr. 1988, pp. 1560–1566.
11. Z. Gigus and J. Malik, “Computing the aspect graph for line drawings of polyhedral objects,” IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 2, 113–122, Feb. 1990.
12. M. Hebert and T. Kanade, “The 3d-profile method for object recognition,” in Proc. IEEE Comp. Soc. Conf Computer Vision and Pattern Recognition, IEEE, New York, June 1988, pp. 458–463.
13. 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.
14. Y. L. Kergosien, “La famille des projections orthogonales d’une surface et ses singularity,” C.R. Acad. Sci. Paris, vol. 292, pp. 929–932, 1981.
15. D. J. Kriegman and J. Ponce, “Computing exact aspect graphs objects: Solids of revolution,” in Proc. IEEE Workshop Interpretation of 3D Scenes, IEEE, New York, Nov. 1989, pp. 116–121.
16. D. J. Kriegman and J. Ponce, “Computing exact aspect graphs of curved objects: Parametric surfaces,” in Proc. Eighth Nat. Conf. Artificial Intelligence, Cambridge, MA: AAAI Press/MIT Press, June 1990, pp. 1074–1079.
17. J.J. Koenderink and A. J. van Doom, “The singularities of visual mapping,” Biol. Cybern., vol. 24, pp. 51–59, 1976.
18. J.J. Koenderink and A. J. van Doom, “The internal representation of solid shape with respect to vision,” Biol. Cybern., vol. 32, pp. 211–216, 1979.
19. K. Melhorn, Data Structures and Algorithms, vol. 3: Multidimensional Searching and Computational Geometry. New York: Springer-Verlag, 1984.
20. W. H. Plantinga and C. R. Dyer, “An algorithm for constructing the aspect graph,” in Proc. 27th. Symp. Foundation of Computer Science, IEEE, New York, 1986, pp. 123–131.
21. W. H. Plantinga and C. R. Dyer, “Visibility, occlusion and the aspect graph,” Univ. Wisconsin—Madison, Tech. Rep. 736, Dec. 1987.
22. W. H. Plantinga and C. R. Dyer, “Visibility, occlusion and the aspect graph,” Int. J. Comput. Vision, 1990.
23. F. P. Preparata and M. I. Shamos, Computational Geometry, An Introduction. New York: Springer-Verlag, 1985.
24. J. H. Rieger, “On the classification of views of piecewise smooth objects,” Image Vision Comput., vol. 5, no. 2, pp. 91–97, May 1987.
25. J. Stewman and K. Bowyer, “Aspect graphs for convex planar-face objects,” in Proc. IEEE Comput. Soc. Workshop Computer Vision, IEEE, New York, Dec. 1987, pp. 123–130.
26. J. Stewman and K. Bowyer, “Creating the perspective projection aspect graph of polyhedral objects,” in Proc. Second Int. Conf Computer Vision, IEEE, New York, Dec. 1988, pp. 494–500.
27. T. Sripradisvarakul and R. Jain, “Generating aspect graphs for curved objects,” in Proc. IEEE Workshop Interpretation of 3D Scenes, IEEE, New York Nov. 1989, pp. 109–115.
28. N. Sarnak and R. E. Tarjan, “Planar point location using persistent search trees” Commun. ACM vol. 29 no. 7. pp — 679, July 1986.