We follow general ideas of SDT applied to visual search (Palmer et al.,
2000). In our model, we allow an effect of encoding-capacity limitations (McLean,
1999; Mazyar, Van den Berg, & Ma,
2012). We assume that discriminability of a single item depends on the number of items in a display (set-size) according to a power function:
\(\def\upalpha{\unicode[Times]{x3B1}}\)\(\def\upbeta{\unicode[Times]{x3B2}}\)\(\def\upgamma{\unicode[Times]{x3B3}}\)\(\def\updelta{\unicode[Times]{x3B4}}\)\(\def\upvarepsilon{\unicode[Times]{x3B5}}\)\(\def\upzeta{\unicode[Times]{x3B6}}\)\(\def\upeta{\unicode[Times]{x3B7}}\)\(\def\uptheta{\unicode[Times]{x3B8}}\)\(\def\upiota{\unicode[Times]{x3B9}}\)\(\def\upkappa{\unicode[Times]{x3BA}}\)\(\def\uplambda{\unicode[Times]{x3BB}}\)\(\def\upmu{\unicode[Times]{x3BC}}\)\(\def\upnu{\unicode[Times]{x3BD}}\)\(\def\upxi{\unicode[Times]{x3BE}}\)\(\def\upomicron{\unicode[Times]{x3BF}}\)\(\def\uppi{\unicode[Times]{x3C0}}\)\(\def\uprho{\unicode[Times]{x3C1}}\)\(\def\upsigma{\unicode[Times]{x3C3}}\)\(\def\uptau{\unicode[Times]{x3C4}}\)\(\def\upupsilon{\unicode[Times]{x3C5}}\)\(\def\upphi{\unicode[Times]{x3C6}}\)\(\def\upchi{\unicode[Times]{x3C7}}\)\(\def\uppsy{\unicode[Times]{x3C8}}\)\(\def\upomega{\unicode[Times]{x3C9}}\)\(\def\bialpha{\boldsymbol{\alpha}}\)\(\def\bibeta{\boldsymbol{\beta}}\)\(\def\bigamma{\boldsymbol{\gamma}}\)\(\def\bidelta{\boldsymbol{\delta}}\)\(\def\bivarepsilon{\boldsymbol{\varepsilon}}\)\(\def\bizeta{\boldsymbol{\zeta}}\)\(\def\bieta{\boldsymbol{\eta}}\)\(\def\bitheta{\boldsymbol{\theta}}\)\(\def\biiota{\boldsymbol{\iota}}\)\(\def\bikappa{\boldsymbol{\kappa}}\)\(\def\bilambda{\boldsymbol{\lambda}}\)\(\def\bimu{\boldsymbol{\mu}}\)\(\def\binu{\boldsymbol{\nu}}\)\(\def\bixi{\boldsymbol{\xi}}\)\(\def\biomicron{\boldsymbol{\micron}}\)\(\def\bipi{\boldsymbol{\pi}}\)\(\def\birho{\boldsymbol{\rho}}\)\(\def\bisigma{\boldsymbol{\sigma}}\)\(\def\bitau{\boldsymbol{\tau}}\)\(\def\biupsilon{\boldsymbol{\upsilon}}\)\(\def\biphi{\boldsymbol{\phi}}\)\(\def\bichi{\boldsymbol{\chi}}\)\(\def\bipsy{\boldsymbol{\psy}}\)\(\def\biomega{\boldsymbol{\omega}}\)\(\def\bupalpha{\unicode[Times]{x1D6C2}}\)\(\def\bupbeta{\unicode[Times]{x1D6C3}}\)\(\def\bupgamma{\unicode[Times]{x1D6C4}}\)\(\def\bupdelta{\unicode[Times]{x1D6C5}}\)\(\def\bupepsilon{\unicode[Times]{x1D6C6}}\)\(\def\bupvarepsilon{\unicode[Times]{x1D6DC}}\)\(\def\bupzeta{\unicode[Times]{x1D6C7}}\)\(\def\bupeta{\unicode[Times]{x1D6C8}}\)\(\def\buptheta{\unicode[Times]{x1D6C9}}\)\(\def\bupiota{\unicode[Times]{x1D6CA}}\)\(\def\bupkappa{\unicode[Times]{x1D6CB}}\)\(\def\buplambda{\unicode[Times]{x1D6CC}}\)\(\def\bupmu{\unicode[Times]{x1D6CD}}\)\(\def\bupnu{\unicode[Times]{x1D6CE}}\)\(\def\bupxi{\unicode[Times]{x1D6CF}}\)\(\def\bupomicron{\unicode[Times]{x1D6D0}}\)\(\def\buppi{\unicode[Times]{x1D6D1}}\)\(\def\buprho{\unicode[Times]{x1D6D2}}\)\(\def\bupsigma{\unicode[Times]{x1D6D4}}\)\(\def\buptau{\unicode[Times]{x1D6D5}}\)\(\def\bupupsilon{\unicode[Times]{x1D6D6}}\)\(\def\bupphi{\unicode[Times]{x1D6D7}}\)\(\def\bupchi{\unicode[Times]{x1D6D8}}\)\(\def\buppsy{\unicode[Times]{x1D6D9}}\)\(\def\bupomega{\unicode[Times]{x1D6DA}}\)\(\def\bupvartheta{\unicode[Times]{x1D6DD}}\)\(\def\bGamma{\bf{\Gamma}}\)\(\def\bDelta{\bf{\Delta}}\)\(\def\bTheta{\bf{\Theta}}\)\(\def\bLambda{\bf{\Lambda}}\)\(\def\bXi{\bf{\Xi}}\)\(\def\bPi{\bf{\Pi}}\)\(\def\bSigma{\bf{\Sigma}}\)\(\def\bUpsilon{\bf{\Upsilon}}\)\(\def\bPhi{\bf{\Phi}}\)\(\def\bPsi{\bf{\Psi}}\)\(\def\bOmega{\bf{\Omega}}\)\(\def\iGamma{\unicode[Times]{x1D6E4}}\)\(\def\iDelta{\unicode[Times]{x1D6E5}}\)\(\def\iTheta{\unicode[Times]{x1D6E9}}\)\(\def\iLambda{\unicode[Times]{x1D6EC}}\)\(\def\iXi{\unicode[Times]{x1D6EF}}\)\(\def\iPi{\unicode[Times]{x1D6F1}}\)\(\def\iSigma{\unicode[Times]{x1D6F4}}\)\(\def\iUpsilon{\unicode[Times]{x1D6F6}}\)\(\def\iPhi{\unicode[Times]{x1D6F7}}\)\(\def\iPsi{\unicode[Times]{x1D6F9}}\)\(\def\iOmega{\unicode[Times]{x1D6FA}}\)\(\def\biGamma{\unicode[Times]{x1D71E}}\)\(\def\biDelta{\unicode[Times]{x1D71F}}\)\(\def\biTheta{\unicode[Times]{x1D723}}\)\(\def\biLambda{\unicode[Times]{x1D726}}\)\(\def\biXi{\unicode[Times]{x1D729}}\)\(\def\biPi{\unicode[Times]{x1D72B}}\)\(\def\biSigma{\unicode[Times]{x1D72E}}\)\(\def\biUpsilon{\unicode[Times]{x1D730}}\)\(\def\biPhi{\unicode[Times]{x1D731}}\)\(\def\biPsi{\unicode[Times]{x1D733}}\)\(\def\biOmega{\unicode[Times]{x1D734}}\)\begin{equation}d_{1n}^{\prime} = {{d_1^{\prime} } \over {{n^{{b \over 2}}}}}{\rm {,}}\end{equation}
where
Display Formula\({d^{\prime} _1}\) is discriminability for set size 1,
n is set size, and
b is a measure of the set-size effect:
b = 0 for unlimited capacity (independent processing of items) and
b = 1 for fixed capacity (sample size).
To predict search performance, we must specify a decision model. It computes the participant's
d′ for a search task as a function of the local signal-to-noise ratio (
Display Formula\({d^{\prime} _{1n}}\)) and set size:
\begin{equation}{d^{\prime} _n} = f\left( {{{d^{\prime} }_{1n}},n} \right){\rm {.}}\end{equation}
We used an ideal decision model (e.g., Mazyar et al.,
2012). For each trial, this model calculates the likelihoods of the observed signals under the hypotheses of target present and target absent and selects the one with the higher total likelihood. Assuming equal priors, Gaussian noise, and selecting internal variables
xD = −0.5 and
xT = 0.5 for distractor and target, the log-likelihood ratio (target present/target absent) for a single trial is
\begin{equation}L = \log {1 \over n}\sum\limits_{i = 1}^n {{e^{{{{x_i}} \over {{\sigma ^2}}}}}} {\rm {,}}\end{equation}
where
xi is a noisy internal variable for object
i and
σ is the standard deviation of the noise. The ideal model selects the response “target present” when
L > 0 and “target absent” otherwise.
To simplify the fitting procedure, we used a polynomial approximation of simulation results for the appropriate range of parameters (Põder,
2017):
\begin{equation}{d^{\prime} _n} = {{{{d^{\prime} }_{1n}}_{}} \over {{n^{0.40 - 0.35\log {{d^{\prime} }_{1n}}_{} - 0.22{{\log }^2}{{d^{\prime} }_{1n}}}}}}{\rm {.}}\end{equation}
Assuming that in our experiments the participants searched a one-color subset of items for one target only, we used half of the actual set size as n in model fitting.
It is a usual assumption that the internal representation of a relevant stimulus parameter is not necessarily proportional to its physical counterpart. Frequently, this relationship has been expressed as a power function (Palmer et al.,
2000). In some contrast-discrimination studies, more complex sigmoid curves have been used (e.g., Foley,
1994; Foley & Schwarz,
1998). We found that our conjunction-search data can be accurately fitted by a Naka–Rushton function (Naka & Rushton,
1966):
\begin{equation}d_1^{\prime} = {d_m}{{{x^k}} \over {{x^k} + {c^k}}}{\rm {,}}\end{equation}
where
dm is an asymptotic response,
x is the physical target–distractor difference (length − width of the stimulus bar),
c is a semisaturation constant (
x value where the response is equal to half of the asymptote), and
k is the slope at that point. Thus, our full search model has four free parameters: the capacity-limitation exponent
b and three parameters of the Naka–Rushton function (
dm,
c,
k). This model was compared with two simpler ones: an unlimited-capacity model with exponent
b = 0 and a limited-capacity model with a power-transducer function
\begin{equation}d_1^{\prime} = w{x^k}\end{equation}
instead of a Naka–Rushton one. Both simpler models have three free parameters.
The models predict
d′ values for a yes/no visual-search task. The predicted
d′ values were converted into predictions of unbiased proportion correct:
\begin{equation}{P_c} = \Phi \left( {{{{{d^{\prime} }_n}} \over 2}} \right){\rm {,}}\end{equation}
where Φ is the standard normal distribution function (Macmillan & Creelman,
1991). The behavior of the model as dependent on different parameters is illustrated in
Supplementary Figure S1.
Our individual data sets consisted of 21 to 36 proportions correct. Microsoft Excel Solver was used to find the maximum-likelihood parameters of a model by minimizing the likelihood-ratio statistic
\begin{equation}G = 2\mathop \sum \limits_i {O_i} \cdot ln\left( {{{{O_i}} \over {{E_i}}}} \right){\rm {,}}\end{equation}
where
Oi is the observed and
Ei the predicted count in cell
i.
To control for possible effects of decision bias, we repeated our model fits using unbiased proportions correct:
\begin{equation}{P_c} = \Phi \left[ {{{z(H) - z(F)} \over 2}} \right]{\rm {,}}\end{equation}
where
H and
F are the proportions of hits and false alarms, Φ is the standard normal distribution function, and
z is the inverse of the normal distribution function.