Dosher Barbara Anne, Han Songmei, Lu Zhong-Lin
Memory, Attention, Perception Laboratory, Department of Cognitive Sciences, Institute for Mathematical Behavioral Sciences, University of California, Irvine, CA 92697-5100, USA.
J Exp Psychol Hum Percept Perform. 2004 Feb;30(1):3-27. doi: 10.1037/0096-1523.30.1.3.
The difficulty of visual search may depend on assignment of the same visual elements as targets and distractors-search asymmetry. Easy C-in-O searches and difficult O-in-C searches are often associated with parallel and serial search, respectively. Here, the time course of visual search was measured for both tasks with speed-accuracy methods. The time courses of the 2 tasks were similar and independent of display size. New probabilistic parallel and serial search models and sophisticated-guessing variants made predictions about time course and accuracy of visual search. The probabilistic parallel model provided an excellent account of the data, but the serial model did not. Asymptotic search accuracies and display size effects were consistent with a signal-detection analysis, with lower variance encoding of Cs than Os. In the absence of eye movements, asymmetric visual search, long considered an example of serial deployment of covert attention, is qualitatively and quantitatively consistent with parallel search processes.
视觉搜索的难度可能取决于将相同的视觉元素指定为目标和干扰项——搜索不对称性。容易的“C在O中”搜索和困难的“O在C中”搜索通常分别与并行搜索和串行搜索相关联。在这里，使用速度-准确性方法测量了这两项任务的视觉搜索时间进程。这两项任务的时间进程相似且与显示大小无关。新的概率并行和串行搜索模型以及复杂猜测变体对视觉搜索的时间进程和准确性做出了预测。概率并行模型对数据提供了很好的解释，但串行模型却没有。渐近搜索准确性和显示大小效应与信号检测分析一致，C的编码方差低于O。在没有眼动的情况下，长期以来被视为隐蔽注意力串行部署示例的不对称视觉搜索，在定性和定量上与并行搜索过程一致。
