Hostname: page-component-6766d58669-zlvph Total loading time: 0 Render date: 2026-05-23T23:44:03.992Z Has data issue: false hasContentIssue false

Analyzing vision at the complexity level

Published online by Cambridge University Press:  19 May 2011

John K. Tsotsos
Affiliation:
Department of Computer Science, University of Toronto and The Canadian Institute for Advanced Research, 10 King's College Rd., Toronto, Ontario, Canada M5S 1A4. Electronic mail: tsotsos@ai.toronto.edu

Abstract

The general problem of visual search can be shown to be computationally intractable in a formal, complexity-theoretic sense, yet visual search is extensively involved in everyday perception, and biological systems manage to perform it remarkably well. Complexity level analysis may resolve this contradiction. Visual search can be reshaped into tractability through approximations and by optimizing the resources devoted to visual processing. Architectural constraints can be derived using the minimum cost principle to rule out a large class of potential solutions. The evidence speaks strongly against bottom-up approaches to vision. In particular, the constraints suggest an attentional mechanism that exploits knowledge of the specific problem being solved. This analysis of visual search performance in terms of attentional influences on visual information processing and complexity satisfaction allows a large body of neurophysiological and psychological evidence to be tied together.

Information

Type
Target Article
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable