Quickest change detection under a nuisance change

We consider the problem of quickest change detection (QCD) for a signal which may undergo both a nuisance and a critical change. Our goal is to detect the critical change without raising a false alarm over the nuisance change. An optimal sequential change detection procedure is proposed for the Baye...

Full description

Saved in:
Bibliographic Details
Main Authors: Lau, Tze Siong, Tay, Wee Peng
Other Authors: School of Electrical and Electronic Engineering
Format: Conference or Workshop Item
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/137341
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-137341
record_format dspace
spelling sg-ntu-dr.10356-1373412020-03-18T05:10:22Z Quickest change detection under a nuisance change Lau, Tze Siong Tay, Wee Peng School of Electrical and Electronic Engineering 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) Engineering::Electrical and electronic engineering Quickest Change Detection Nuisance Change We consider the problem of quickest change detection (QCD) for a signal which may undergo both a nuisance and a critical change. Our goal is to detect the critical change without raising a false alarm over the nuisance change. An optimal sequential change detection procedure is proposed for the Bayesian formulation of our QCD problem. A sequential change detection procedure based on the generalized likelihood ratio test (GLRT) statistic is also proposed for the non-Bayesian formulation. We show that our proposed test statistics can be computed efficiently via respective recursive update schemes. We compare our proposed stopping rules with the naive 2-stage procedures, which attempt to detect the changes using separate optimal stopping procedures (i.e., the Shiryaev procedure in the Bayesian formulation, and the CuSum procedure in the non-Bayesian formulation) for the nuisance and critical changes. Simulations demonstrate that our proposed rules outperform the 2-stage procedures. NRF (Natl Research Foundation, S’pore) MOE (Min. of Education, S’pore) Accepted version 2020-03-18T05:10:22Z 2020-03-18T05:10:22Z 2018 Conference Paper Lau, T. S., & Tay, W. P. (2018). Quickest change detection under a nuisance change. Proceedings of 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 6643-6647. doi:10.1109/icassp.2018.8462436 9781538646588 https://hdl.handle.net/10356/137341 10.1109/ICASSP.2018.8462436 2-s2.0-85054212083 6643 6647 en © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ICASSP.2018.8462436 application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Quickest Change Detection
Nuisance Change
spellingShingle Engineering::Electrical and electronic engineering
Quickest Change Detection
Nuisance Change
Lau, Tze Siong
Tay, Wee Peng
Quickest change detection under a nuisance change
description We consider the problem of quickest change detection (QCD) for a signal which may undergo both a nuisance and a critical change. Our goal is to detect the critical change without raising a false alarm over the nuisance change. An optimal sequential change detection procedure is proposed for the Bayesian formulation of our QCD problem. A sequential change detection procedure based on the generalized likelihood ratio test (GLRT) statistic is also proposed for the non-Bayesian formulation. We show that our proposed test statistics can be computed efficiently via respective recursive update schemes. We compare our proposed stopping rules with the naive 2-stage procedures, which attempt to detect the changes using separate optimal stopping procedures (i.e., the Shiryaev procedure in the Bayesian formulation, and the CuSum procedure in the non-Bayesian formulation) for the nuisance and critical changes. Simulations demonstrate that our proposed rules outperform the 2-stage procedures.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Lau, Tze Siong
Tay, Wee Peng
format Conference or Workshop Item
author Lau, Tze Siong
Tay, Wee Peng
author_sort Lau, Tze Siong
title Quickest change detection under a nuisance change
title_short Quickest change detection under a nuisance change
title_full Quickest change detection under a nuisance change
title_fullStr Quickest change detection under a nuisance change
title_full_unstemmed Quickest change detection under a nuisance change
title_sort quickest change detection under a nuisance change
publishDate 2020
url https://hdl.handle.net/10356/137341
_version_ 1681045239020650496