Revision as of 23:02, 30 April 2014 by Lee714 (Talk | contribs)


Neyman-Pearson Lemma and Receiver Operating Characteristic Curve

A slecture by ECE student Soonam Lee

Partly based on the ECE662 Spring 2014 lecture material of Prof. Mireille Boutin.


Introduction

The purpose of this slecture is understanding Neyman-Pearson Lemma and Receiver Operating Characteristic (ROC) curve from theory to application. The fundamental theories stem from statistics and these can be used for signal detection and classification. In order to firmly understand these concepts, we will review statistical concept first including False alarm and Miss. After that, we will consider Bayes' decision rule using cost function. Next, we visit Neyman-Pearson test and minimax test. Lastly, we will discuss ROC curves. Note that we only consider two classes case in this slecture, but the concept can be extended to multiple classes.


The General Two Classes Case Problem

Before starting our discussion, we have the following setup:

  • $ X $ a measure random variable, random vector, or random process
  • $ x \in \mathcal{X} $ is a realization of $ X $
  • $ \theta \in \Theta $ are unknown parameters
  • $ f(x; \theta) $ is pdf of $ X $ (a known function)

Two distinct hypotheses on $ \theta $ such that $ H_0: \theta \in \Theta_0 $ versus $ H_1: \theta \in \Theta_1 $ where $ \Theta_0 $, $ \Theta_1 $ is partition of $ \Theta $ into two disjoint regions

$ \Theta_0 \cup \Theta_1 = \Theta, \qquad \Theta_0 \cap \Theta_1 = \phi $

False Alarm Rate and Miss Rate

From statistical references [1, 2], these two hypotheses make one of two types of error, named Type I Error and Type II Error. If $ \theta \in \Theta_0 $ but the hypothesis test incorrectly decides to reject $ H_0 $, then the test has made a Type I Error. If, on the other hand, $ \theta \in \Theta_1 $ but the test decides to accept $ H_0 $ a Type II Error has been made. Type I Error is often called false positive error and Type II Error is called false negative error. These two types are depicted in Table 1.

Decision
Accpet $ H_0 $
Decision
Reject $ H_0 $
Truth $ H_0 $ Correct Decision Type I Error
Truth $ H_1 $ Type II Error Correct Decision

Table 1: Two types of erros in hypothesis testing.

Different from statistical perspective, engineers focus more on false alarm rate and miss errors rate. False alarm rate is the same as Type I Error such that a given condition has been fulfilled, when it actually has not been fulfilled, that is, erroneously a positive effect has been assumed. Miss rate is such that a given condition has not been fulfilled, when it actually has been fulfilled. In general, to compute miss rate, computing hit rate and subtract hit rate from 1 to get miss rate.

Let's assume a test function $ \phi(x) $ such that

$ \phi(x) $ = $ \, \Big\{ $
1, decide $ H_1 $
0, decide $ H_0 $

The test function $ \phi(x) $ maps $ \mathcal{X} $ to the decision space $ \{0, 1\} $ for deciding $ H_0 $ and $ H_1 $. The function $ \phi(x) $ induces a partition of $ \mathcal{X} $ into decision regions. Denote $ \mathcal{X}_0 = \{x: \phi(x) = 0 \} $ and $ \mathcal{X}_1 = \{x: \phi(x) = 1 \} $. Then, false alarm and miss probabilities with the function $ \phi $ can be expressed as follow:

$ P_F (\theta) = E_\theta [\phi] = \int_{\mathcal{X}} \phi(x) f(x; \theta) dx, \quad \theta \in \Theta_0 $
$ = \int_{\mathcal{X}_1} f(x|\theta) dx, \quad \theta \in \Theta_0 $
$ P_M (\theta) = E_\theta [1 - \phi] = \int_\mathcal{X} [1 - \phi(x)] f(x; \theta) dx, \quad \theta \in \Theta_1 $
$ = 1 - \int_{\mathcal{X}_1} f(x|\theta) dx, \quad \theta \in \Theta_1. $

The probability of correctly deciding $ H_1 $ is called hit probability such that

$ 1- P_M (\theta) = P_D(\theta) = E_\theta [\phi], \quad \theta \in \Theta_1. $

From the ECE 662 class note [3], Professor introduced error 1 ($ \epsilon_1 $) and error 2 ($ \epsilon_2 $) that are basically same concepts as miss rate and false alarm rate respectively. The only difference is representing the expectation values as fraction as follow:

$ \epsilon_1 = \frac{\text{Number of test data points labeled as class } \Theta_0 \text{ misclassified as class } \Theta_1}{\text{Number of test data points in class } \Theta_0} $
$ \epsilon_2 = \frac{\text{Number of test data points labeled as class } \Theta_1 \text{ misclassified as class } \Theta_0}{\text{Number of test data points in class } \Theta_1} $

Neyman-Pearson Lemma [4, 5]

The frequentist approach assumes no priors on $ H_0 $ or $ H_1 $ so one cannot sensibly define an average probability of error of risk to minimize. Thus we adopt the alternative criterion: constrain false alarm and minimize miss probabilities. It turns out that to find an optimum test satisfying such a constraint we will need to extend our previous definition of a test function $ \phi $ to allow for randomized decisions such that

$ \phi(x) $ = $ \Big $ \{
1, decide $ H_1 $
q, flip a coin with Prob{Heads} $ (H_1) $ = q
0, decide $ H_0 $

Note, we have interpretation:

$ \phi(x) = P(\text{say }H_1 \,|\, \text{ observation }x) $

False alarm probability and detection probability are functions of $ \theta $

$ E_\theta [\phi] = \int_{\mathcal{X}} \phi(x) f(x; \theta) dx = $ $ \Big \{ $
$ P_F(\theta),\,\quad \theta \in \Theta_0 $
$ P_D(\theta),\,\quad \theta \in \Theta_1 $

We define a test $ \phi $ is said to be (false alarm) level $ \alpha \in [0,1] $ if

$ \underset{\theta \in \Theta_0} \operatorname{max} P_F(\theta) \leq \alpha $

We also define the power function of a test $ \phi $ as

$ \beta(\theta) = P_D (\theta) = 1 - P_M(\theta), \theta \in \Theta_1. $

Here, we consider only simple hypotheses case where $ \theta \in \{\theta_0, \theta_1\} $

$ H_0: X \, \sim \, f(x; \theta_0) $
$ H_1: X \, \sim \, f(x; \theta_1) $

Post your slecture material here. Guidelines:

  • If you are making a text slecture
    • Type text using wikitext markup languages
    • Type all equations using latex code between <math> </math> tags.
    • You may include links to other Project Rhea pages.




References

[1] G. Casella and R. L. Berger, "Statistical inference (2nd Edition)," Cengage Learning, 2001.
[2] J. K. Ghosh, "STAT528: Introduction to Mathematical Statistics," Fall 2012, Purdue University.
[3] M. Boutin, "ECE662: Statistical Pattern Recognition and Decision Making Process," Spring 2014, Purdue University.
[4] K. Fukunaga, "Introduction to statistical pattern recognition (2nd Edition)," Academic Press, Inc., San Diego, CA, USA, 1990.
[5] A. Hero, "EECS564: Esitmation, Filtering, and Detection," Fall 2010, University of Michigan.

Questions and comments

If you have any questions, comments, etc. please post them on this page.


Back to ECE662, Spring 2014

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett