3 accepted papers
The problem of quickest growing dynamic anomaly detection in sensor networks is studied. Initially, the observations at the sensors, which are sampled sequentially by the decision maker, are generated according to a pre-change distribution. At some unknown but deterministic time instant, a dynamic a…
The problem of transient quickest change detection (QCD) is studied, in which the change from the initial to the final phase does not happen instantaneously, but after a series of cascading transient phases of finite durations, each one corresponding to a different probability distribution. The goal…
We propose a statistical algorithm for detecting line outages in a power system and show that it has better performance than other schemes proposed in the literature. Our algorithm is based on the Cumulative Sum (CuSum) test from the Quickest Change Detection (QCD) literature. It exploits the statis…