skip to content
 

Decentralized Quickest Change Detection in Hidden Markov Models for Sensor Networks

Presented by: 
C-D Fuh [National Central University, Taiwan]
Date: 
Wednesday 15th January 2014 - 10:00 to 10:30
Venue: 
INI Seminar Room 1
Abstract: 
The decentralized quickest change detection problem is studied in sensor networks, where a set of sensors take observations from a hidden Markov model (HMM) and send sensor messages to a fusion center, which makes a final decision when observations are stopped. It is assumed that the parameter $\theta$ in the HMM model changes from $\theta_0$ to $\theta_1$ at some unknown time. The problem is to determine the policies at the sensor and fusion center levels to jointly optimize the detection delay subject to the average run length (ARL) to false alarm constraint. The primary goal of this paper is to investigate how to choose the best binary stationary quantizers from the both theoretical and computational viewpoints when a CUSUM-type scheme is used at the fusion center. Further research is also given.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons