Decentralized Quickest Change Detection in Hidden Markov Models for Sensor Networks

Add to your list(s) Download to your calendar using vCal

• Fuh, C-D (National Central University, Taiwan)
• Wednesday 15 January 2014, 10:00-10:30
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Inference for Change-Point and Related Processes

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 $ heta$ in the HMM model changes from $ heta_0$ to $ heta_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.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.