arrow
Return

Visual search has no memory

delete1998-08-01
delete465
PRE
AI
T
Todd S. Horowitz *
J
Jeremy M. Wolfe
DOI:10.1038/29068delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Humans spend a lot of time searching for things, such as roadside traffic signs(1), soccer balls(2) or tumours in mammograms(3). These tasks involve the deployment of attention from one item in the visual field to the next. Common sense suggests that rejected items should be noted in some fashion so that effort is not expended in re-examining items that have been attended to and rejected. However, common sense is wrong. Here we asked human observers to search for a letter 'T' among letters 'L'. This search demands visual attention and normally proceeds at a rate of 20-30 milliseconds per item(4). In the critical condition, we randomly relocated all letters every 111 milliseconds. This made it impossible for the subjects to keep track of the progress of the search. Nevertheless, the efficiency of the search was unchanged. Theories of visual search all assume that search relies on accumulating information about the identity of objects over time(5-7). Such theories predict that search efficiency will be drastically reduced if the scene is continually shuffled while the observer is trying to search through it. As we show that efficiency is not impaired, the standard theories must be revised.
Keywords:
ATTENTION
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Nature cover
Nature
IF:
48.5
Papers:
1.8W
Citations:
96.5W

Organization

No organization information available
Cited Papers

Cited Papers

err
IF0
err
err0
PREAI
err
errShare
errSave
The diffusion of water vapour through human skin
err1956-04-27
err0
errOAAI
errD. F. Brebner; D. McK. Kerslake; J. L. Waddell
errShare
errSave
Change blindness
err1997-10-01
err969
PREAI
errSimons, Daniel J.; Levin, Daniel T.
errShare
errSave
no more