By Topic

Quickest detection of an abrupt change in a random sequence with finite change-time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu, Y. ; Dept. of Electr. Eng., Queen''s Univ., Kingston, Ont., Canada ; Blostein, S.D.

This paper proposes a new procedure for quickest detection of an abrupt change in a random sequence, where a change is known to occur with probability one. Applications include on-line speech segmentation, edge detection in image processing, and communications channel monitoring. In contrast to Shiryayev's (1963) problem formulation, prior knowledge of a change-time distribution is not required. The optimality criterion considered is similar to Shiryayev's, except that the expected delay is to be minimized subject to both overall false alarm probability and false alarm average run length constraints under this criterion, theoretical study shows that the new procedure approximates an optimal but unrealizable Bayesian procedure, particularly for small signal changes or for low probability of false alarm. Simulations confirm that under such conditions, the new procedure compares favorably with Page's (1954) CUSUM, an optimized moving-window fixed-sample-size (FSS) procedure, and a special ease of the Girshick-Rubin-Shiryayev (1952) procedure

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 6 )