By Topic

A suboptimal quadratic change detection scheme

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)
Nikiforov, I.V. ; Univ. de Technol. de Troyes, France

We address the problem of detecting changes in multivariate Gaussian random signals with an unknown mean after the change. The window-limited generalized-likelihood ratio (GLR) scheme is a well-known approach to solve this problem. However, this algorithm involves at least (log γ)/ρ likelihood-ratio computations at each stage, where γ(γ→∞) is the mean time before a false alarm and ρ is the Kullback-Leibler information. We establish a new suboptimal recursive approach which is based on a collection of L parallel recursive χ2 tests instead of the window-limited GLR scheme. This new approach involves only a fixed number L of likelihood-ratio computations at each stage for any combinations of γ and ρ. By choosing an acceptable value of nonoptimality, the designer can easily find a tradeoff between the complexity of the quadratic change detection algorithm and its efficiency

Published in:

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