Detection and Estimation
Detection Theory

Multislot and Multistream Quickest Change Detection in Statistically Periodic Processes

Taposh Banerjee, Gene Whipps, Prudhvi Gurram

Date & Time

01:00 am – 01:00 am


Mixture-based algorithms are proposed for detecting a change in the distribution of a statistically periodic process in multislot and multistream settings. In the multislot change detection problem, the distribution of the observed process can change in any subset of time slots in each period. In the multistream change detection problem, there are parallel streams of observations, and the change can affect an arbitrary subset of streams. It is shown that the algorithms are asymptotically optimal in a Bayesian setting.


Taposh Banerjee

University of Texas at San Antonio

Gene Whipps

CCDC Army Research Lab

Prudhvi Gurram

CCDC Army Research Lab and Booz Allen Hamilton
Private Conversation

Reach out to the speaker privately

Questions & Answers

Post a publicly available question

No questions have been asked.

Session Chair

Ali Tajer

Rensselaer Polytechnic Institute