Two strategies in the problem of change detection and isolation

  • Authors:
  • I. V. Nikiforov

  • Affiliations:
  • Univ. de Technol. de Troyes

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

Abstract

The comparison between optimal sequential and nonsequential (fixed-size sample) strategies in the problem of abrupt change detection and isolation is discussed. In particular, we show that sometimes a simple fixed-size sample algorithm is almost as efficient as an optimal sequential algorithm which leads to a burdensome number of arithmetical operations