3.2 Neyman–Pearson Detection Problem Formulation

In Section 2.2.1 a binary hypothesis testing problem (2.1) is used to formulate the pure-sample target detection as two hypotheses, H0 and H1, which represent the absence and presence of a signal source in an observed sample r, respectively. This section places its main focus on a particular type of detection problem when there is no prior knowledge of the two hypotheses and cost functions. It is generally called the Neyman–Pearson detection problem cast by (2.92.11).

More specifically, assume that the observation process is described by a random process Yt. When this process is observed at a particular time instant t = t0, it is referred to as an observation y which can be described by a random variable img. If the probability distribution of img is further assumed to be P(y) with its probability density function given by p(y), the binary hypothesis testing problem (2.1) can be described by

(3.1) equation

where the hypotheses H0 and H1 can be observed from the variable img whose probability distributions are derived from p(y) under each hypothesis, denoted ...

Get Hyperspectral Data Processing: Algorithm Design and Analysis now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.