<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/technology/cnxml/schema/dtd/0.5/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:bib="http://bibtexml.sf.net/" xmlns:m="http://www.w3.org/1998/Math/MathML" id="new">
  <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Beyond the Basics</name>
  <metadata xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
  <md:version xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">1.4</md:version>
  <md:created xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2008/06/22 10:37:46 GMT-5</md:created>
  <md:revised xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2008/06/30 23:34:53.277 GMT-5</md:revised>
  <md:authorlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
      <md:author xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">detection theory</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">generalized likelihood ratio</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">likelihood ratio</md:keyword>
  </md:keywordlist>

  <md:abstract xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Pointers to extensions to the Detection Theory Basics.</md:abstract>
</metadata>

  <content xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
   <section xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="formore"><name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">For more...</name>
   <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="morethantwo">
    Many problems in statistical signal processing and communications can be solved using basic detection theory.
    For example, determining whether an airplane is located at a specific range and direction with radar and whether a received bit is a <m:math><m:cn>0</m:cn></m:math> or a
    <m:math><m:cn>1</m:cn></m:math> are both solved with
    <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m16253" target="mf">matched filter detectors</cnxn>.
    However, many elaborations of deciding which of two models best describes a given dataset abound.
    For instance, suppose we have more than two models for the data.
    Previous modules hint at how to expand beyond two models
    (see <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m16251" target="maximum"/> and
    <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m16253" target="gaussian"/>).
    However, no extensions for Neyman-Pearson detectors for more than two models exists.
    </para>

    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="more">
    To learn more about the basics of detection theory and beyond, see the books by <cite xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="#vantrees">Van Trees</cite>, <cite xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="#kay">Kay</cite>
    and <cite xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="#mcdonoughwhalen">McDonough and Whalen</cite>,
    and several modules on Connexions (search for 'likelihood ratio', 'detection theory' and 'matched filter').
    The Wikipedia article on
    <link xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="http://en.wikipedia.org/wiki/Statistical_hypothesis_testing">Statistical Hypothesis Testing</link> describes what is called detection theory here more abstractly from a statistician's viewpoint.
    </para>
    </section>
  
   
    <section xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="beyond"><name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Beyond Simple Problems</name>
    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="imprecise">
    More interesting (and challenging) are situations where the data models are imprecise to some degree.
    The simplest case is when some model parameter is not known.
    For example, suppose the exact time of the radar return is not known (i.e., the airplane's range is uncertain).
    Here, the unknown parameter is the signal's time-of-origin.
    We must somehow determine that parameter <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">and</emphasis> determine if the signal is actually present.
    </para>
    
    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="glrt">
    As you might expect, the likelihood ratio remains the focus of attention, now in the guise of what is known as the
    <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">generalized likelihood ratio test</term> (GLRT)
    (see this Connexions <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11238">module</cnxn>).<note xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" type="footnote">
    The Wikipedia article on the <link xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="http://en.wikipedia.org/wiki/Likelihood_ratio">Likelihood-ratio test</link> is concerned with the Generalized Likelihood Ratio Test.
    </note>
    This technique and others opens the door to what are known as <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">simultaneous estimation and detection algorithms</term>.
    </para>
    
    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="nonpara">
    Some unknowns may not be parametric and prevent a precise description of a model by a probability function.
    What do we do when the amplitude distribution function of the additive noise is not well characterized?
    So-called <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">robust detection</term> represents one attempt to address these problems. See <cite xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="#poor"/> for more. 
    </para>
    
    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="sequential">
    Beyond variations of model uncertainties are new approaches to solving detection problems.
    For example, a subtlety in the basic formulation is that all the data are available.
    Can we do just as well by attempting to make a decision prematurely as the data arrive?
    Note that always taking a <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">fixed</emphasis> fewer number of samples always leads to worse performance.
    Instead, we acquire only the amount of data needed to make a decision.
    This approach is known as <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">sequential detection</term> or the <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">sequential probability ratio test</term> (SPRT).
    See modules in Connexions and the classic book by
    <cite xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" src="#wald">Wald</cite>.
    </para>
  </section>
  </content>

<bib:file>
  <bib:entry id="kay">
    <bib:book>
      <bib:author>S.M. Kay</bib:author>
      <bib:title>Fundamentals of Statistical Signal Processing, Volume 2: Detection Theory</bib:title>
      <bib:publisher>Prentice Hall</bib:publisher>
      <bib:year>1998</bib:year>
    </bib:book>
  </bib:entry>

  <bib:entry id="mcdonoughwhalen">
    <bib:book>
      <bib:author>R.N. McDonough and A.D. Whalen</bib:author>
      <bib:title>Detection of Signals in Noise</bib:title>
      <bib:publisher>Academic Press</bib:publisher>
      <bib:year>1995</bib:year>
    </bib:book>
  </bib:entry>

  <bib:entry id="poor">
    <bib:book>
      <bib:author>H.V. Poor</bib:author>
      <bib:title>An Introduction to Signal Detection and Estimation</bib:title>
      <bib:publisher>Springer</bib:publisher>
      <bib:year>1988</bib:year>
    </bib:book>
  </bib:entry>

  <bib:entry id="vantrees">
    <bib:book>
      <bib:author>H.L. Van Trees</bib:author>
      <bib:title>Detection, Estimation, and Modulation Theory, Part I</bib:title>
      <bib:publisher>Wiley-Interscience</bib:publisher>
      <bib:year>2001</bib:year>
    </bib:book>
  </bib:entry>

  <bib:entry id="wald">
    <bib:book>
      <bib:author>A. Wald</bib:author>
      <bib:title>Sequential Analysis</bib:title>
      <bib:publisher>Dover</bib:publisher>
      <bib:year>2004</bib:year>
    </bib:book>
  </bib:entry>

</bib:file>
  
</document>
