HAL CCSD
A simple change detection scheme
Nikiforov, Igor, V.
Laboratoire Modélisation et Sûreté des Systèmes (LM2S) ; Institut Charles Delaunay (ICD) ; Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)
International audience
ISSN: 0165-1684
EISSN: 1872-7557
Signal Processing
Elsevier
hal-02290442
https://utt.hal.science/hal-02290442
https://utt.hal.science/hal-02290442
Signal Processing, 2001, 81 (1), pp.149-172. ⟨10.1016/S0165-1684(00)00198-5⟩
DOI: 10.1016/S0165-1684(00)00198-5
info:eu-repo/semantics/altIdentifier/doi/10.1016/S0165-1684(00)00198-5
en
[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
info:eu-repo/semantics/article
Journal articles
The problem of detecting changes in a stochastic system is addressed. When the model parameters after the change are unknown the generalized likelihood ratio (GLR) scheme is usually used to solve the problem. This scheme is asymptotically optimal but it is also particularly time-consuming which makes questionable its real time implementation. The window-limited GLR scheme, which takes into account only significant (for the detection) previous observations, is less demanding but often it is still time-consuming. In this paper we introduce an alternative approach to reduce the computational burden of the GLR scheme. The idea of this solution is to decompose a given parameter space into several subsets so chosen that in each subset the detection problem can be solved with loss of a small part of optimality by a recursive change detection algorithm.
2001-01