One shot schemes for decentralized quickest change detection

Event Details
  • Date/Time:
    • Tuesday April 7, 2009
      11:00 am - 12:00 pm
  • Location: Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    $0.00
  • Extras:
Contact
Anita Race
H. Milton Stewart School of Industrial and Systems Engineering
Contact Anita Race
Summaries

Summary Sentence: One shot schemes for decentralized quickest change detection

Full Summary: One shot schemes for decentralized quickest change detection and quickest detection in coupled systems

TITLE: One shot schemes for decentralized quickest change detection and quickest detection in coupled systems

SPEAKER: Professor Olympia Hadjiliadis

ABSTRACT:

We consider the problem of sequential detection of a change in the drift of independent Brownian motions and the mean of discrete-time exponential family observations received in parallel at the sensors of decentralized systems. We examine the performance of one shot schemes in decentralized detection in the case of many sensors with respect to appropriate criteria. One shot schemes are schemes in which the sensors communicate with the fusion center only once; when they must signal a detection. The communication is clearly asynchronous and we consider the case that the fusion center employs one of two strategies, the minimal and the maximal. According to the former strategy an alarm is issued at the fusion center the moment in which the first one of the sensors issues an alarm, whereas according to the latter strategy an alarm is issued when both sensors have reported a detection. In this work we derive closed form expressions for the expected delay of both the minimal and the maximal strategies in the case that CUSUM stopping rules are employed by the sensors and for the specific value of a 0 correlation across sensors. We prove asymptotic optimality of the above strategies in the case of across-sensor independence and specify the optimal threshold selection at the sensors. We also point out the special interpretation of the extreme case of a correlation of -1.

Moreover, we address the problem of quickest detection in coupled systems in models that display more general dependencies in the observations captured by general It processes. We set-up appropriate stochastic optimization problems with respect to Kullback-Leibler divergence and prove the asymptotic optimality of the N-CUSUM stopping rule in this case. We discuss applications of this work in the detection of structural damages.

The first part of the talk is joint work with H. Zhang and H.V. Poor and the second part of this work is joint work with Tobias Schaefer and H.V. Poor.

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
detection
Status
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Oct 12, 2009 - 4:36pm
  • Last Updated: Oct 7, 2016 - 9:47pm