Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes

Artificial Intelligence

Volumn 105, Issue 1-2, 1998, Pages 47-75

  Parodi, P ^a   Lancewicki, R ^a   Vijh, A ^a   Tsotsos, J K ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Computational complexity; Line drawings; Random polyhedral scenes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS); RANDOM PROCESSES;

LINE DRAWINGS; RANDOM POLYHEDRAL SCENES;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0032181743     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(98)00077-0     Document Type: Article

References (35)

1. A. Appel, The notion of quantitative invisibility and the machine rendering of solids, in: Proceedings of the ACM National Conference, Thompson Books, Washington, DC, 1967, pp. 387-393.
2. B. Bollobas, Random Graphs, Academic Press, London, 1985.
3. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: J. Mylopoulos, R. Reiter (Eds.), Proceedings IJCAI-91, Sydney, Australia, 1991, pp. 331-337.
4. M.B. Clowes, On seeing things, Artificial Intelligence 2 (1971) 79-116.
5. B. Efron, R.J. Tibshirani, An Introduction to the Bootstrap, Chapman and Hall, London, 1993.
6. J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes, Computer Graphics: Principles and Practice, Addison-Wesley, Reading, MA, 1990.
7. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman, New York, 1979.
8. E.M. Hampel, F.R. Ronchetti, P.J. Rousseeuw, Robust Statistics: The Approach Based on Influence Functions, Wiley, 1986.
9. T. Hogg, C.P. Williams, The hardest constraint problems: a double phase transition, Artificial Intelligence 69 (1994) 359-377.
10. D.A. Huffman, Impossible objects as nonsense sentences, in: B. Meltzer and D. Michie (Eds.), Machine Intelligence 6, Edinburgh University Press, Edinburgh, 1971, pp. 295-323.
11. T. Kanade, A theory of Origami world, Artificial Intelligence 13 (1980) 279-311.
12. L.M. Kirousis, Fast parallel constraint satisfaction, Artificial Intelligence 64 (1993) 147-160.
13. L.M. Kirousis, C.H. Papadimitriou, The complexity of recognizing polyhedral scenes, J. Computer and System Sciences 37 (1988) 14-38.
14. A.K. Mackworth, E.C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25 (1985) 65-74.
15. A.K. Mackworth, E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-92.
16. J. Malik, Interpreting line drawings of curved objects, Internat. J. Computer Vision 1 (1987) 73-103.
17. P. Meer, D. Mintz, D.Y. Kim, A. Rosenfeld, Robust regression methods for computer vision: a review, Internat. J. Comput. Vision 6 (1) (1991) 59-70.
18. R.E. Miles, Random polygons determined by random lines in the plane, in: Proceedings of the National Academy of Science 52 (1964) 901-907.
19. D.G. Mitchell, H.J. Levesque, Some pitfalls for experimenters with random SAT, Artificial Intelligence 81 (1-2) (1996) 111-125.
20. E.M. Palmer, Graphical Evolution, Wiley, New York, 1985.
21. P. Parodi, The complexity of understanding of origami scenes, Internat. J. Computer Vision 18 (2) (1996) 139-170.
22. P. Parodi, R. Lancewicki, A. Vijh, J.K. Tsotsos, Empirically-derived estimates of the complexity of labelling line drawings. Technical Report RBCV-TR-96-52, Department of Computer Science, University of Toronto, Toronto, September 1996.
23. P. Parodi, V. Torre, On the complexity of labeling line drawings of polyhedral scenes, Artificial Intelligence 70 (1994) 239-276.
24. J. Pearl, Heuristics, Addison-Wesley, Reading, MA, 1984.
25. B. Selman, D.G. Mitchell, H.J. Levesque, Generating hard satisfiability problems, Artificial Intelligence 81 (1-2) (1996) 17-29.
26. M. Straforini, C. Coelho, M. Campani, Extraction of vanishing points of images of indoor and outdoor scenes, Image Vision Computing 11 (2) (1993) 91-100.
27. M. Straforini, C. Coelho, M. Campani, V. Torre, The recovery and understanding of a line drawing from indoor scenes, IEEE Trans. Pattern Analysis and Machine Intelligence 14 (2) (1992) 298-303.
28. D. Stoyan, W.S. Kendall, J. Mecke, Stochastic Geometry and its Applications, Wiley, 1996.
29. K. Sugihara, Picture language for skeletal polyhedra, Computer Graphics and Image Processing 8 (1978) 382-405.
30. K. Sugihara, Mathematical structures of line drawings of polyhedrons, IEEE Trans. Pattern Analysis and Machine Intelligence 4 (5) (1982) 458-469.
31. K. Sugihara, An algebraic approach to shape-from-image problems, Artificial Intelligence 23 (1984) 59-95.
32. K. Sugihara, A necessary and sufficient condition for a picture to represent a polyhedral scene, IEEE Trans. Pattern Analysis and Machine Intelligence 6 (5) (1984) 578-586.
33. J.K. Tsotsos, The complexity of perceptual search tasks, in: Proceedings International Joint Conference on Artificial Intelligence (IJCAI-89), Detroit, MI, 1989, pp. 1571-1577.
34. D. Waltz, Understanding line-drawings of scenes with shadows, in: P.H. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, 1975, pp. 19-91.
35. C.P. Williams, T. Hogg, Exploiting the deep structure of constraint problems, Artificial Intelligence 70 (1994) 73-117.