Visual search #2 Flashcards
What did Dulcan + Humphrey’s study show?
1989
~ that searches with homogenous distractors are easier than those with heterogeneous distracters
~ similarity between distractor items important for search efficiency
Duncan + Humphrey’s theory (5)
~ similarity is key for determining speed of search
~ parallel processing = representation of structural units (colour, size, shape…)
~ for response to occur structural unit needs to access visual short-term memory
~ activity of structural unit = object’s similarity to search
~ units are connected to each other and spread activation e.g. spreading suppression on similar non-targets
Top-down control in visual search
telling people what to search for activates top-down processes to interact with bottom-up process = guided search
What are the two stages of visual search?
Parallel and serial processing
Predictions based on Tresiman’s theory of separation of serial and parallel processes in visual search:
if there is limited opportunity for serial search, then features will not be combined (or combined less accurately)
What did the findings surrounding illusory conjunctions support?
~ supports Triesman’s feature integration theory
~ feature extraction occurs automatically and in parallel
~ object recognition requires feature binding
Wolfe, Cave and Francis
1989
~ searches within conjunction sets show beneficial parallel processing
Wolfe’s guided search model
1994
~ suggests ‘candidate targets’ are selected for serial trials
Difference between Duncan + Humphreys and Treisman’s FIT theories
FIT = the features extracted in parallel are primitive components, NOT conjunction D+H = say conjunction extracted in parallel
When searching for a similar target you use…
slow, serial search
When searching for a dissimilar target you use…
fast, parallel search
Difference between hard and easy distractors
hard distractors contain similar shapes/angles/joints to the target shape, easy distractors do not
When searching through similar non-targets you use…
fast, parallel search
When searching through dissimilar non-targets you use…
slow, serial search