Title: A guided tour of Guided Search 4'0
1A guided tour ofGuided Search 4.0
- Jeremy M Wolfe
- Visual Attention Lab
- Brigham Womens Hospital
- Harvard Medical School
2What are we trying to explain?
Find the raspberry
3What are we trying to explain?
Find the queen
4What are we trying to explain?
Find the tumor
5What are we trying to explain?
Where is the cancer? 3-4 CM BELOW THE TOP
(NORTH) AND ABOUT 2-3 CM WEST OF THE PECTORAL
MUSCLE SHADOW. IT'S A SUBTLE NODULAR DENSITY.
Find the tumor
6What are we trying to explain?
Where is the cancer in 9? 3-4 CM BELOW THE TOP
(NORTH) AND ABOUT 2-3 CM WEST OF THE PECTORAL
MUSCLE SHADOW. IT'S A SUBTLE NODULAR DENSITY.
Yes, well, subtle is a good word!
7What are we trying to explain?
Find the threat
8What are we trying to explainin the lab?
Some tasks are easy
Find the 5
9What are we trying to explain?
Some tasks are hard
Find the 5
10What are we trying to explain?
Some tasks are in-between
Find the green 5
11This is not a bimodal distribution
Wolfe, J. M. (1998). What do 1,000,000 trials
tell us about visual search? Psychological
Science, 9(1), 33-39.
12Different tasks yield different slopes
But slope is not a simple diagnostic for type.
13There is a continuum of searches
14The Goals of Guided Search (and this talk)
1) To model the range of human search behavior.
2) To include more than just mean RTs for
target-present trials.
3) To avoid an excess of special pleading and
deus ex machina theorizing.
15How do we do it?
There is a stimulus
16Local salience is computed
17It is local differences that create bottom-up
salience
18red
steep
A limited set of coarse, categorical features are
computed
19Coarse?
Find the orientation oddballs.
20Categorical? Find (10 deg left tilt)
21Why?
T-10, D50,-50
T-10, D30,-70
Categorically steep
Not categorical
22A weighted sum creates an activation map.
23The activation map All else being equal, local
salience will be weighted heavily and will
attract attention (bottom-up).
24Bottom-up salience is not enough (Hence,
activation not salience map)
Find the target
25Top-down guidance Give weight to what you want
Find the green verticals
26An activation map note It is hard to set the
weight on bottom-up salience to zero.
Find the green verticals
27The activation map guides re-entrant attentional
selection of objects
28Meaning that you do not see the output of the
activation map.
29Lets elaborate on that a bit.
Guided Search is a two-stage model
First Stage
30The core idea of Guided Search
?
?
?
?
?
?
?
?
First Stage
Second Stage
31This is a low-threshold SDT model (sort of)
?
?
?
?
?
?
?
?
First Stage
Second Stage
32Followed by a high-threshold, binding stage
?
?
?
?
?
?
?
?
First Stage
Second Stage
33What do we know about capacity limitations in
search?
34The rate of processing can be 20-30 items per
second
?
?
?
?
?
?
?
?
Based on slopes of RT x set size functions
35But each item takes 100 - several hundred msec to
process
Based on attentional dwell time experiments (e.g.
AB)
G
H
T
3
R
Y
6
F
J
T1
T2
36We infer that more than one item can be in this
pipeline at on time.
Based on attentional dwell time experiments (e.g.
AB)
G
H
T
3
R
Y
6
F
J
T1
T2
37We model this as an asynchronous diffusion
process.
A few hundred msec
Serial selection through the bottleneck.
N items can accumulate information at any one time
38Diffusion models have some nice features.
Geometry produces these skewed RT distributions
Suppose this is the average rate of information
accumulation
And suppose that rate is variable and normally
distributed.
39Human data look like this, too.
Gamma distributions fit well.
This is part of a big data set on our website
http/search.bwh.harvard.edu
40A vexing problem
Find the 5
41Ummthere is no 5
How do you know when to stop?
42We know you are not marking every reject
How do you know when to stop?
43The number marked as rejected is small (4 ish at
mostmaybe 0)
How do you know when to stop?
44Some sort of adaptive process is at work
correct
correct
correct
error
error
The details of the quitting threshold are tricky