By Topic

A Page test with nuisance parameter estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Abraham, D.A. ; Naval Undersea Warfare Center, New London, CT, USA

The detection of the onset of a signal is a common and relevant problem in signal processing. The Page test [1954] using the log-likelihood ratio is optimal for minimizing the worst case average delay before detection (D¯) while constraining the average time between false alarms (T¯). Realistic problems typically include unknown parameters having the same value under signal-absent and signal-present hypotheses, known as nuisance parameters. In this correspondence, the Page test is generalized to account for nuisance parameters. The inherent signal-absent decision making of the Page test is exploited to identify signal-free data used to estimate the nuisance parameters. Due to the independence of this data and the current Page test statistic, analysis is feasible. Wald- and Siegmund-based approximations to D¯ and T¯ are derived and shown to simplify to those of the standard Page test as the estimation becomes perfect. The results for a Gaussian shift in mean signal with unknown variance are derived and verified through simulation, where it is seen that the Siegmund-based approximation provides more accuracy. It is seen that the linear asymptotic (in the sense of a large threshold) relationship between the threshold and D¯ is preserved when nuisance parameters are estimated. However, the exponential asymptotic relationship between the threshold and T¯ becomes a power law approximating an exponential

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 6 )