Sensitivity index

The sensitivity index or discriminability index or detectability index is a dimensionless statistic used in signal detection theory. A higher index indicates that the signal can be more readily detected.

Figure 1: Bayes-optimal classification error probability $e_{b}$ and Bayes discriminability index $d'_{b}$ between two univariate histograms computed from their overlap area. Figure 2: Same computed from the overlap volume of two bivariate histograms. Figure 3: discriminability indices of two univariate normal distributions with unequal variances. The classification boundary is in black. Figure 4: discriminability indices of two bivariate normal distributions with unequal covariance matrices (ellipses are 1 sd error ellipses). Color-bar shows the relative contribution to the discriminability by each dimension. These are computed by numerical methods.

Definition

The discriminability index is the separation between the means of two distributions (typically the signal and the noise distributions), in units of the standard deviation.

Equal variances/covariances

For two univariate distributions $a$ and $b$ with the same standard deviation, it is denoted by $d'$ ('dee-prime'):

$d'={\frac {\left\vert \mu _{a}-\mu _{b}\right\vert }{\sigma }}$.

In higher dimensions, i.e. with two multivariate distributions with the same variance-covariance matrix $\mathbf {\Sigma }$, (whose symmetric square-root, the standard deviation matrix, is $\mathbf {S}$), this generalizes to the Mahalanobis distance between the two distributions:

$d'={\sqrt {({\boldsymbol {\mu }}_{a}-{\boldsymbol {\mu }}_{b})'\mathbf {\Sigma } ^{-1}({\boldsymbol {\mu }}_{a}-{\boldsymbol {\mu }}_{b})}}=\lVert \mathbf {S} ^{-1}({\boldsymbol {\mu }}_{a}-{\boldsymbol {\mu }}_{b})\rVert =\lVert {\boldsymbol {\mu }}_{a}-{\boldsymbol {\mu }}_{b}\rVert /\sigma _{\boldsymbol {\mu }}$,

where $\sigma _{\boldsymbol {\mu }}=1/\lVert \mathbf {S} ^{-1}{\boldsymbol {\mu }}\rVert$ is the 1d slice of the sd along the unit vector ${\boldsymbol {\mu }}$ through the means, i.e. the $d'$ equals the $d'$ along the 1d slice through the means.

For two bivariate distributions with equal variance-covariance, this is given by:

${d'}^{2}={\frac {1}{1-\rho ^{2}}}\left({d'}_{x}^{2}+{d'}_{y}^{2}-2\rho {d'}_{x}{d'}_{y}\right)$,

where $\rho$ is the correlation coefficient, and here $d'_{x}={\frac {{\mu _{b}}_{x}-{\mu _{a}}_{x}}{\sigma _{x}}}$ and $d'_{y}={\frac {{\mu _{b}}_{y}-{\mu _{a}}_{y}}{\sigma _{y}}}$, i.e. including the signs of the mean differences instead of the absolute.

$d'$ is also estimated as $Z({\text{hit rate}})-Z({\text{false alarm rate}})$.

Unequal variances/covariances

When the two distributions have different standard deviations (or in general dimensions, different covariance matrices), there exist several contending indices, all of which reduce to $d'$ for equal variance/covariance.

Bayes discriminability index

This is the maximum (Bayes-optimal) discriminability index for two distributions, based on the amount of their overlap, i.e. the optimal (Bayes) error of classification $e_{b}$ by an ideal observer, or its complement, the optimal accuracy $a_{b}$:

$d'_{b}=-2Z\left({\text{Bayes error rate }}e_{b}\right)=2Z\left({\text{best accuracy rate }}a_{b}\right)$,

where $Z$ is the inverse cumulative distribution function of the standard normal. The Bayes discriminability between univariate or multivariate normal distributions can be numerically computed (Matlab code), and may also be used as an approximation when the distributions are close to normal.

$d'_{b}$ is a positive-definite statistical distance measure that is free of assumptions about the distributions, like the Kullback-Leibler divergence $D_{\text{KL}}$. $D_{\text{KL}}(a,b)$ is asymmetric, whereas $d'_{b}(a,b)$ is symmetric for the two distributions. However, $d'_{b}$ does not satisfy the triangle inequality, so it is not a full metric.

In particular, for a yes/no task between two univariate normal distributions with means $\mu _{a},\mu _{b}$ and variances $v_{a}>v_{b}$, the Bayes-optimal classification accuracies are:

$p(A|a)=p({\chi '}_{1,v_{a}\lambda }^{2}>v_{b}c),\;\;p(B|b)=p({\chi '}_{1,v_{b}\lambda }^{2}<v_{a}c)$,

where $\chi '^{2}$ denotes the non-central chi-squared distribution, $\lambda =\left({\frac {\mu _{a}-\mu _{b}}{v_{a}-v_{b}}}\right)^{2}$, and $c=\lambda +{\frac {\ln v_{a}-\ln v_{b}}{v_{a}-v_{b}}}$. The Bayes discriminability $d'_{b}=2Z\left({\frac {p\left(A|a\right)+p\left(B|b\right)}{2}}\right).$

$d'_{b}$ can also be computed from the ROC curve of a yes/no task between two univariate normal distributions with a single shifting criterion. It can also be computed from the ROC curve of any two distributions (in any number of variables) with a shifting likelihood-ratio, by locating the point on the ROC curve that is farthest from the diagonal.

For a two-interval task between these distributions, the optimal accuracy is $a_{b}=p\left({\tilde {\chi }}_{{\boldsymbol {w}},{\boldsymbol {k}},{\boldsymbol {\lambda }},0,0}^{2}>0\right)$ (${\tilde {\chi }}^{2}$ denotes the generalized chi-squared distribution), where ${\boldsymbol {w}}={\begin{bmatrix}\sigma _{s}^{2}&-\sigma _{n}^{2}\end{bmatrix}},\;{\boldsymbol {k}}={\begin{bmatrix}1&1\end{bmatrix}},\;{\boldsymbol {\lambda }}={\frac {\mu _{s}-\mu _{n}}{\sigma _{s}^{2}-\sigma _{n}^{2}}}{\begin{bmatrix}\sigma _{s}^{2}&\sigma _{n}^{2}\end{bmatrix}}$. The Bayes discriminability $d'_{b}=2Z\left(a_{b}\right)$.

RMS sd discriminability index

A common approximate (i.e. sub-optimal) discriminability index that has a closed-form is to take the average of the variances, i.e. the rms of the two standard deviations: $d'_{a}=\left\vert \mu _{a}-\mu _{b}\right\vert /\sigma _{\text{rms}}$ (also denoted by $d_{a}$). It is ${\sqrt {2}}$ times the $z$-score of the area under the receiver operating characteristic curve (AUC) of a single-criterion observer. This index is extended to general dimensions as the Mahalanobis distance using the pooled covariance, i.e. with $\mathbf {S} _{\text{rms}}=\left[\left(\mathbf {\Sigma } _{a}+\mathbf {\Sigma } _{b}\right)/2\right]^{\frac {1}{2}}$ as the common sd matrix.

Average sd discriminability index

Another index is $d'_{e}=\left\vert \mu _{a}-\mu _{b}\right\vert /\sigma _{\text{avg}}$, extended to general dimensions using $\mathbf {S} _{\text{avg}}=\left(\mathbf {S} _{a}+\mathbf {S} _{b}\right)/2$ as the common sd matrix.

Comparison of the indices

It has been shown that for two univariate normal distributions, $d'_{a}\leq d'_{e}\leq d'_{b}$, and for multivariate normal distributions, $d'_{a}\leq d'_{e}$ still.

Thus, $d'_{a}$ and $d'_{e}$ underestimate the maximum discriminability $d'_{b}$ of univariate normal distributions. $d'_{a}$ can underestimate $d'_{b}$ by a maximum of approximately 30%. At the limit of high discriminability for univariate normal distributions, $d'_{e}$ converges to $d'_{b}$. These results often hold true in higher dimensions, but not always. Simpson and Fitter promoted $d'_{a}$ as the best index, particularly for two-interval tasks, but Das and Geisler have shown that $d'_{b}$ is the optimal discriminability in all cases, and $d'_{e}$ is often a better closed-form approximation than $d'_{a}$, even for two-interval tasks.

The approximate index $d'_{gm}$, which uses the geometric mean of the sd's, is less than $d'_{b}$ at small discriminability, but greater at large discriminability.

Contribution to discriminability by each dimension

In general, the contribution to the total discriminability by each dimension or feature may be measured using the amount by which the discriminability drops when that dimension is removed. If the total Bayes discriminability is $d'$ and the Bayes discriminability with dimension $i$ removed is $d'_{-i}$, we can define the contribution of dimension $i$ as ${\sqrt {d'^{2}-{d'_{-i}}^{2}}}$. This is the same as the individual discriminability of dimension $i$ when the covariance matrices are equal and diagonal, but in the other cases, this measure more accurately reflects the contribution of a dimension than its individual discriminability.

Scaling the discriminability of two distributions

Scaling the discriminability of two distributions, by linearly interpolating the mean vector and sd matrix (square root of the covariance matrix) of one towards the other. Ellipses are the error ellipses of the two distributions. Black curve is a quadratic boundary that separates the two distributions.

We may sometimes want to scale the discriminability of two data distributions by moving them closer or farther apart. One such case is when we are modeling a detection or classification task, and the model performance exceeds that of the subject or observed data. In that case, we can move the model variable distributions closer together so that it matches the observed performance, while also predicting which specific data points should start overlapping and be misclassified.

There are several ways of doing this. One is to compute the mean vector and covariance matrix of the two distributions, then effect a linear transformation to interpolate the mean and sd matrix (square root of the covariance matrix) of one of the distributions towards the other.

Another way that is by computing the decision variables of the data points (log likelihood ratio that a point belongs to one distribution vs another) under a multinormal model, then moving these decision variables closer together or farther apart.

See also

• Receiver operating characteristic (ROC)
• Summary statistics
• Effect size

References

• Wickens, Thomas D. (2001). Elementary Signal Detection Theory. OUP USA. ch. 2, p. 20. ISBN 0-19-509250-3.

External links

• Interactive signal detection theory tutorial including calculation of d′.