A suboptimal quadratic change detection scheme

Abstract : 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 /spl gamma/)//spl rho/ likelihood-ratio computations at each stage, where /spl gamma/(/spl gamma//spl rarr//spl infin/) is the mean time before a false alarm and /spl rho/ is the Kullback-Leibler information. We establish a new suboptimal recursive approach which is based on a collection of L parallel recursive /spl chi//sup 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 /spl gamma/ and /spl rho/. 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02297226
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Wednesday, September 25, 2019 - 6:30:55 PM
Last modification on : Thursday, September 26, 2019 - 1:26:06 AM

Identifiers

Collections

Citation

Igor Nikiforov. A suboptimal quadratic change detection scheme. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2000, 46 (6), pp.2095-2107. ⟨10.1109/18.868480⟩. ⟨hal-02297226⟩

Share

Metrics

Record views

6