Start Submission Become a Reviewer

Reading: Data-Efficient Quickest Change Detection

Download

A- A+
dyslexia friendly

Articles

Data-Efficient Quickest Change Detection

Authors:

Taposh Banerjee,

ECE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign,, US
X close

Venugopal V. Veeravalli

ECE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign,, US
X close

Abstract

In the classical problem of quickest change detection, a decision maker observes a sequence of random variables. At some point in time, the distribution of the random variables changes abruptly. The objective is to detect this change in distribution with minimum possible delay, subject to a constraint on the false alarm rate. In many applications of quickest change detection, e.g., where the changes are infrequent, it is of interest to control the cost of observations or the cost of data acquired before the change point. To this end, in this survey paper, data-efficient versions of the classical quickest change detection problems are studied, and a summary of existing results on these problems is provided. Some extensions to distributed sensor networks are also discussed.

DOI: http://dx.doi.org/10.4038/sljastats.v5i4.7790

DOI: http://doi.org/10.4038/sljastats.v5i4.7790
How to Cite: Banerjee, T. & Veeravalli, V.V., (2014). Data-Efficient Quickest Change Detection. Sri Lankan Journal of Applied Statistics. 5(4), pp.183–208. DOI: http://doi.org/10.4038/sljastats.v5i4.7790
34
Views
40
Downloads
Published on 15 Dec 2014.
Peer Reviewed

Downloads

  • PDF (EN)

    comments powered by Disqus