The Complexity of Visual Search Tasks

  • John K. Tsotsos
Chapter

Abstract

One of the most frustrating things about studying attention is that research is so often is accompanied by vague discussions of capacity limits, bottlenecks, resource limits, allocations of attentional resources, and the like. How can these notions be made more concrete? The sub-area of computer science known as Computational Complexity is concerned with the theoretical issues dealing with the cost of achieving solutions to problems in terms of time, memory and processing power as a function of problem size. How much of attentional behaviour can be explained using this viewpoint?

Keywords

Visual Search Receptive Field Turing Machine Bound Visual Biological Vision 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Stockmeyer, A. Chandra. Intrinsically difficult problems. Scientific American Trends in Computing, (Vol. 1, pp. 88 – 97), New York: Scientific American Inc., (1988).Google Scholar
  2. 2.
    M. Garey, D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman. (1979).MATHGoogle Scholar
  3. 3.
    H. Simon. The architecture of complexity, Proc. American Philosophical Society 106, 467–482.(1962).Google Scholar
  4. 4.
    L. Uhr. Layered ’recognition cone’ networks that preprocess, classify and describe, IEEE Transactions on Computers, 758–768. (1972).Google Scholar
  5. 5.
    J. Feldman, D. Ballard. Connectionist models and their properties, Cognitive Science 6, 205–254.(1982).CrossRefGoogle Scholar
  6. 6.
    J.K. Tsotsos. “A ’Complexity Level’ Analysis of Vision”, Proceedings of International Conference on Computer Vision: Human and Machine Vision Workshop, London, England, June (1987).Google Scholar
  7. 7.
    J.K. Tsotsos. A Complexity Level Analysis of Vision. Behavioral and Brain Sciences, 13,423–455.(1990).CrossRefGoogle Scholar
  8. 8.
    J.S. Judd. Neural network design and the complexity of learning. Cambridge, MA: M.I.T. Press. (1990).Google Scholar
  9. 9.
    M. Davis. Computability and Unsolvability, New York.: McGraw-Hill. (1958).MATHGoogle Scholar
  10. 10.
    M. Davis. The Undecidable, New York: Hewlett Raven Press. (1965).Google Scholar
  11. 11.
    J.K. Tsotsos. The Complexity of Perceptual Search Tasks. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, Michigan, 1571–1577. (1989).Google Scholar
  12. 12.
    A. Yashuhara. Recursive Function Theory and Logic, New York: Academic Press. (1971).Google Scholar
  13. 13.
    D. Marr. Vision: A computational investigation into the human representation and processing of visual information. San Francisco: Freeman. (1982).Google Scholar
  14. 14.
    R. Rensink. A new proof of the NP-Completeness of Visual Match, TR 89-22, Dept. of Computer Science, University of British Columbia. (1989).Google Scholar
  15. 15.
    P. Parodi, R. Lancewicki, A. Vijh, A., J.K. Tsotsos. “Empiricaly-Derived Estimates of the Complexity of Labeling Line Drawings of Polyhedral Scenes”, Artificial Intelligence105, p47 – 75, (1998).MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    A.K. Mackworth, E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25 p65–74. (1985).CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • John K. Tsotsos
    • 1
  1. 1.Dept. of Computer Science, and Centre for Vision ResearchYork UniversityTorontoCanada

Personalised recommendations