THE COMPLEXITY OF VISUAL SEARCH TASKS

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?

[1]  J. Stephen Judd,et al.  Neural network design and the complexity of learning , 1990, Neural network modeling and connectionism.

[2]  A. K. Chandra,et al.  Intrinsically Difficult Problems , 1979 .

[3]  John K. Tsotsos.  The Complexity of Perceptual Search Tasks , 1989, IJCAI.

[4]  John K. Tsotsos.  Analyzing vision at the complexity level , 1990, Behavioral and Brain Sciences.

[5]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[6]  Ann Yasuhara,et al.  Recursive function theory and logic , 1971, Computer science and applied mathematics.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Leonard Uhr,et al.  Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe , 1972, IEEE Transactions on Computers.

[9]  John K. Tsotsos,et al.  Empirically-Derived Estimates of the Complexity of Labeling Line Drawings of Polyhedral Scenes , 1998, Artif. Intell..

[10]  Ronald A. Rensink,et al.  A New Proof of the NP Completeness of Visual Match , 1989 .

[11]  HERBERT A. SIMON,et al.  The Architecture of Complexity , 1991 .

[12]  R. Weale.  Vision. A Computational Investigation Into the Human Representation and Processing of Visual Information. David Marr , 1983 .

[13]  Jerome A. Feldman,et al.  Connectionist Models and Their Properties , 1982, Cogn. Sci..

[14]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.