Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). (c) Oxford University Press, 2015. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy).

date: 18 November 2017

Abstract and Keywords

In her original Feature Integration Theory, Anne Treisman proposed that we process a limited set of basic preattentive, visual features in parallel across the visual field. Binding those features together into coherent, recognizable objects requires selective attention of item after item. In Treisman’s original conception, searches were divided into parallel feature searches and other serial self-terminating searches. Wolfe’s Guided Search model added the idea that the deployment of attention could be guided by preattentive information. In this view, the efficiency of search is related to the effectiveness of guidance on a continuum from perfect guidance, in the case of simple feature pop-out, to no guidance when no basic features distinguish target from distractors. This chapter reviews the evidence for different basic, preattentive features and describes the current understanding of the rules of guidance, the mechanics of visual search, and the relationship of these processes to visual awareness.

Keywords: visual search, preattentive, feature integration, guided search, selective attention, object recognition, parallel processing, serial selection, pop-out, binding

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.