Title :
Quickest change point identification across a sensor array
Author_Institution :
Dept. of Electr. & Comput. Eng., Worcester Polytech. Inst., Worcester, MA, USA
fDate :
Oct. 29 2012-Nov. 1 2012
Abstract :
The problem of quickly detecting a statistical change and identifying the change source is considered. In the problem studied, there are multiple sensors. A change can first occur at any one of these sensors and propagate to other sensors. One is required to detect the presence of such change with a minimal delay and furthermore identify the sensor that first observes the change. Three performance metrics, namely detection delay, false alarm probability and false identification probability, are of interest. The optimal stopping rule, determining when one should stop sampling and claim a change has occurred, and the optimal terminal decision rule, determining which sensor first observes the change, that minimize a weighted sum of these three performance metrics are characterized. We obtain the optimal solution by first converting the problem at the hand to a Markovian stopping time problem and then solving the problem using tools from the optimal stopping theory.
Keywords :
Markov processes; array signal processing; decision theory; probability; sensor fusion; signal detection; Markovian stopping time problem; change source identification; detection delay; false alarm probability; false identification probability; minimal delay; multiple sensors; optimal stopping rule; optimal stopping theory; optimal terminal decision rule; quickest change point identification; sensor array; statistical change detection; Chemicals; Cost function; Delay; Indexes; Markov processes; Probability;
Conference_Titel :
MILITARY COMMUNICATIONS CONFERENCE, 2012 - MILCOM 2012
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-4673-1729-0
DOI :
10.1109/MILCOM.2012.6415699