# Detection theory

(Redirected from Signal detection theory)

Detection theory or signal detection theory is a means to measure the ability to differentiate between information-bearing patterns (called stimulus in living organisms, signal in machines) and random patterns that distract from the information (called noise, consisting of background stimuli and random activity of the detection machine and of the nervous system of the operator). In the field of electronics, the separation of such patterns from a disguising background is referred to as signal recovery.[1]

According to the theory, there are a number of determiners of how a detecting system will detect a signal, and where its threshold levels will be. The theory can explain how changing the threshold will affect the ability to discern, often exposing how adapted the system is to the task, purpose or goal at which it is aimed.

Another field which is closely related to signal detection theory is called compressed sensing (or compressive sensing). The objective of compressed sensing is to recover high dimensional but with low complexity entities from only a few measurements. Thus, one of the most important applications of compressed sensing is in the recovery of high dimensional signals which are known to be sparse (or nearly sparse) with only a few linear measurements. The number of measurements needed in the recovery of signals is by far smaller than what Nyquist sampling theorem requires provided that the signal is sparse, meaning that it only contains a few non-zero elements. There are different methods of signal recovery in compressed sensing including basis pursuit , expander recovery algorithm[2], CoSaMP [3]and also fast non-iterative algorithm[4]. In all of the recovery methods mentioned above, choosing an appropriate measurement matrix using probabilistic constructions or deterministic constructions, is of great importance. In other words, measurement matrices must satisfy certain specific conditions such as RIP (Restricted Isometry Property) or Null-Space property in order to achieve robust sparse recovery.

Back to the detecting theory, when the detecting system is a human being, characteristics such as experience, expectations, physiological state (e.g., fatigue) and other factors can affect the threshold applied. For instance, a sentry in wartime might be likely to detect fainter stimuli than the same sentry in peacetime due to a lower criterion, however they might also be more likely to treat innocuous stimuli as a threat.

Much of the early work in detection theory was done by radar researchers.[5] By 1954, the theory was fully developed on the theoretical side as described by Peterson, Birdsall and Fox[6] and the foundation for the psychological theory was made by Wilson P. Tanner, David M. Green, and John A. Swets, also in 1954.[7] Detection theory was used in 1966 by John A. Swets and David M. Green for psychophysics.[8] Green and Swets criticized the traditional methods of psychophysics for their inability to discriminate between the real sensitivity of subjects and their (potential) response biases.[9]

Detection theory has applications in many fields such as diagnostics of any kind, quality control, telecommunications, and psychology. The concept is similar to the signal to noise ratio used in the sciences and confusion matrices used in artificial intelligence. It is also usable in alarm management, where it is important to separate important events from background noise.

## PsychologyEdit

Signal detection theory (SDT) is used when psychologists want to measure the way we make decisions under conditions of uncertainty, such as how we would perceive distances in foggy conditions. SDT assumes that the decision maker is not a passive receiver of information, but an active decision-maker who makes difficult perceptual judgments under conditions of uncertainty. In foggy circumstances, we are forced to decide how far away from us an object is, based solely upon visual stimulus which is impaired by the fog. Since the brightness of the object, such as a traffic light, is used by the brain to discriminate the distance of an object, and the fog reduces the brightness of objects, we perceive the object to be much farther away than it actually is (see also decision theory).

To apply signal detection theory to a data set where stimuli were either present or absent, and the observer categorized each trial as having the stimulus present or absent, the trials are sorted into one of four categories:

Respond "Absent" Respond "Present"
Stimulus Present Miss Hit
Stimulus Absent Correct Rejection False Alarm

Based on the proportions of these types of trials, numerical estimates of sensitivity can be obtained with statistics like the sensitivity index d' and A',[10] and response bias can be estimated with statistics like c and β.[10]

Signal detection theory can also be applied to memory experiments, where items are presented on a study list for later testing. A test list is created by combining these 'old' items with novel, 'new' items that did not appear on the study list. On each test trial the subject will respond 'yes, this was on the study list' or 'no, this was not on the study list'. Items presented on the study list are called Targets, and new items are called Distractors. Saying 'Yes' to a target constitutes a Hit, while saying 'Yes' to a distractor constitutes a False Alarm.

Respond "No" Respond "Yes"
Target Miss Hit
Distractor Correct Rejection False Alarm

## ApplicationsEdit

Signal Detection Theory has wide application, both in humans and animals. Topics include memory, stimulus characterists of schedules of reinforcement, etc.

### Sensitivity or discriminabilityEdit

Conceptually, sensitivity refers to how hard or easy it is to detect that a target stimulus is present from background events. For example, in a recognition memory paradigm, having longer to study to-be-remembered words makes it easier to recognize previously seen or heard words. In contrast, having to remember 30 words rather than 5 makes the discrimination harder. One of the most commonly used statistics for computing sensitivity is the so-called sensitivity index or d'. There are also non-parametric measures, such as the area under the ROC-curve.[9]

### BiasEdit

Bias is the extent to which one response is more probable than another. That is, a receiver may be more likely to respond that a stimulus is present or more likely to respond that a stimulus is not present. Bias is independent of sensitivity. For example, if there is a penalty for either false alarms or misses, this may influence bias. If the stimulus is a bomber, then a miss (failing to detect the plane) may increase deaths, so a liberal bias is likely. In contrast, crying wolf (a false alarm) too often may make people less likely to respond, grounds for a conservative bias.

## MathematicsEdit

### P(H1|y) > P(H2|y) / MAP testingEdit

In the case of making a decision between two hypotheses, H1, absent, and H2, present, in the event of a particular observation, y, a classical approach is to choose H1 when p(H1|y) > p(H2|y) and H2 in the reverse case.[11] In the event that the two a posteriori probabilities are equal, one might choose to default to a single choice (either always choose H1 or always choose H2), or might randomly select either H1 or H2. The a priori probabilities of H1 and H2 can guide this choice, e.g. by always choosing the hypothesis with the higher a priori probability.

When taking this approach, usually what one knows are the conditional probabilities, p(y|H1) and p(y|H2), and the a priori probabilities ${\displaystyle p(H1)=\pi _{1}}$  and ${\displaystyle p(H2)=\pi _{2}}$ . In this case,

${\displaystyle p(H1|y)={\frac {p(y|H1)\cdot \pi _{1}}{p(y)}}}$ ,

${\displaystyle p(H2|y)={\frac {p(y|H2)\cdot \pi _{2}}{p(y)}}}$

where p(y) is the total probability of event y,

${\displaystyle p(y|H1)\cdot \pi _{1}+p(y|H2)\cdot \pi _{2}}$ .

H2 is chosen in case

${\displaystyle {\frac {p(y|H2)\cdot \pi _{2}}{p(y|H1)\cdot \pi _{1}+p(y|H2)\cdot \pi _{2}}}\geq {\frac {p(y|H1)\cdot \pi _{1}}{p(y|H1)\cdot \pi _{1}+p(y|H2)\cdot \pi _{2}}}}$

${\displaystyle \Rightarrow {\frac {p(y|H2)}{p(y|H1)}}\geq {\frac {\pi _{1}}{\pi _{2}}}}$

and H1 otherwise.

Often, the ratio ${\displaystyle {\frac {\pi _{1}}{\pi _{2}}}}$  is called ${\displaystyle \tau _{MAP}}$  and ${\displaystyle {\frac {p(y|H2)}{p(y|H1)}}}$  is called ${\displaystyle L(y)}$ , the likelihood ratio.

Using this terminology, H2 is chosen in case ${\displaystyle L(y)\geq \tau _{MAP}}$ . This is called MAP testing, where MAP stands for "maximum a posteriori").

Taking this approach minimizes the expected number of errors one will make.

### Bayes criterionEdit

In some cases, it is far more important to respond appropriately to H1 than it is to respond appropriately to H2. For example, if an alarm goes off, indicating H1 (an incoming bomber is carrying a nuclear weapon), it is much more important to shoot down the bomber if H1 = TRUE, than it is to avoid sending a fighter squadron to inspect a false alarm (i.e., H1 = FALSE, H2 = TRUE) (assuming a large supply of fighter squadrons). The Bayes criterion is an approach suitable for such cases.[11]

Here a utility is associated with each of four situations:

• ${\displaystyle U_{11}}$ : One responds with behavior appropriate to H1 and H1 is true: fighters destroy bomber, incurring fuel, maintenance, and weapons costs, take risk of some being shot down;
• ${\displaystyle U_{12}}$ : One responds with behavior appropriate to H1 and H2 is true: fighters sent out, incurring fuel and maintenance costs, bomber location remains unknown;
• ${\displaystyle U_{21}}$ : One responds with behavior appropriate to H2 and H1 is true: city destroyed;
• ${\displaystyle U_{22}}$ : One responds with behavior appropriate to H2 and H2 is true: fighters stay home, bomber location remains unknown;

As is shown below, what is important are the differences, ${\displaystyle U_{11}-U_{21}}$  and ${\displaystyle U_{22}-U_{12}}$ .

Similarly, there are four probabilities, ${\displaystyle P_{11}}$ , ${\displaystyle P_{12}}$ , etc., for each of the cases (which are dependent on one's decision strategy).

The Bayes criterion approach is to maximize the expected utility:

${\displaystyle U=P_{11}\cdot U_{11}+P_{21}\cdot U_{21}+P_{12}\cdot U_{12}+P_{22}\cdot U_{22}}$

${\displaystyle U=P_{11}\cdot U_{11}+(1-P_{11})\cdot U_{21}+P_{12}\cdot U_{12}+(1-P_{12})\cdot U_{22}}$

${\displaystyle U=U_{21}+U_{22}+P_{11}\cdot (U_{11}-U_{21})-P_{12}\cdot (U_{22}-U_{12})}$

Effectively, one may maximize the sum,

${\displaystyle U'=P_{11}\cdot (U_{11}-U_{21})-P_{12}\cdot (U_{22}-U_{12})}$ ,

and make the following substitutions:

${\displaystyle P_{11}=\pi _{1}\cdot \int _{R_{1}}p(y|H1)\,dy}$

${\displaystyle P_{12}=\pi _{2}\cdot \int _{R_{1}}p(y|H2)\,dy}$

where ${\displaystyle \pi _{1}}$  and ${\displaystyle \pi _{2}}$  are the a priori probabilities, ${\displaystyle P(H1)}$  and ${\displaystyle P(H2)}$ , and ${\displaystyle R_{1}}$  is the region of observation events, y, that are responded to as though H1 is true.

${\displaystyle \Rightarrow U'=\int _{R_{1}}\left\{\pi _{1}\cdot (U_{11}-U_{21})\cdot p(y|H1)-\pi _{2}\cdot (U_{22}-U_{12})\cdot p(y|H2)\right\}\,dy}$

${\displaystyle U'}$  and thus ${\displaystyle U}$  are maximized by extending ${\displaystyle R_{1}}$  over the region where

${\displaystyle \pi _{1}\cdot (U_{11}-U_{21})\cdot p(y|H1)-\pi _{2}\cdot (U_{22}-U_{12})\cdot p(y|H2)>0}$

This is accomplished by deciding H2 in case

${\displaystyle \pi _{2}\cdot (U_{22}-U_{12})\cdot p(y|H2)\geq \pi _{1}\cdot (U_{11}-U_{21})\cdot p(y|H1)}$

${\displaystyle \Rightarrow L(y)\equiv {\frac {p(y|H2)}{p(y|H1)}}\geq {\frac {\pi _{1}\cdot (U_{11}-U_{21})}{\pi _{2}\cdot (U_{22}-U_{12})}}\equiv \tau _{B}}$

and H1 otherwise, where L(y) is the so-defined likelihood ratio.

## ReferencesEdit

1. ^ T. H. Wilmshurst (1990). Signal Recovery from Noise in Electronic Instrumentation (2nd ed.). CRC Press. pp. 11 ff. ISBN 0-7503-0058-2.
2. ^ Jafarpour, S.; Xu, W.; Hassibi, B.; Calderbank, R. (September 2009). "Efficient and Robust Compressed Sensing Using Optimized Expander Graphs". IEEE Transactions on Information Theory. 55 (9): 4299–4308. doi:10.1109/tit.2009.2025528. ISSN 0018-9448.
3. ^ Needell, D.; Tropp, J.A. "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples". Applied and Computational Harmonic Analysis. 26 (3): 301–321. doi:10.1016/j.acha.2008.07.002.
4. ^ Lotfi, M.; Vidyasagar, M."A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices".
5. ^ Marcum, J. I. (1947). "A Statistical Theory of Target Detection by Pulsed Radar". The Research Memorandum: 90. Retrieved 2009-06-28.
6. ^ Peterson, W.W., Birdsall, T. G. & Fox, W. C. (1954) The theory of signal detectability. Proceedings of the IRE Professional Group on Information Theory 4, 171-212.
7. ^ Tanner Jr., Wilson P.; John A. Swets (November 1954). "A decision-making theory of visual detection". Psychological Review. 61 (6): 401–409. doi:10.1037/h0058700. PMID 13215690. Retrieved 2009-06-24.
8. ^ Swets, J.A. (ed.) (1964) Signal detection and recognition by human observers. New York: Wiley
9. ^ a b Green, D.M., Swets J.A. (1966) Signal Detection Theory and Psychophysics. New York: Wiley. (ISBN 0-471-32420-5)
10. ^ a b Stanislaw, H; Todorov, N (February 1999). "Calculation of signal detection theory measures". Behavior Research Methods, Instruments, and Computers. 31 (1): 137–49. PMID 10495845.
11. ^ a b Schonhoff, T.A. and Giordano, A.A. (2006) Detection and Estimation Theory and Its Applications. New Jersey: Pearson Education (ISBN 0-13-089499-0)
• Coren, S., Ward, L.M., Enns, J. T. (1994) Sensation and Perception. (4th Ed.) Toronto: Harcourt Brace.
• Kay, SM. Fundamentals of Statistical Signal Processing: Detection Theory (ISBN 0-13-504135-X)
• McNichol, D. (1972) A Primer of Signal Detection Theory. London: George Allen & Unwin.
• Van Trees HL. Detection, Estimation, and Modulation Theory, Part 1 (ISBN 0-471-09517-6; website)
• Wickens, Thomas D., (2002) Elementary Signal Detection Theory. New York: Oxford University Press. (ISBN 0-19-509250-3)