An online Kernel change detection algorithm

207Citations
Citations of this article
170Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A number of abrupt change detection methods have been proposed in the past, among which are efficient model-based techniques such as the Generalized Likelihood Ratio (GLR) test. We consider the case where no accurate nor tractable model can be found, using a model-free approach, called Kernel change detection (KCD). KCD compares two sets of descriptors extracted online from the signal at each time instant: The immediate past set and the immediate future set. Based on the soft margin single-class Support Vector Machine (SVM), we build a dissimilarity measure in feature space between those sets, without estimating densities as an intermediary step. This dissimilarity measure is shown to be asymptotically equivalent to the Fisher ratio in the Gaussian case. Implementation issues are addressed; in particular, the dissimilarity measure can be computed online in input space. Simulation results on both synthetic signals and real music signals show the efficiency of KCD. © 2005 IEEE.

Cite

CITATION STYLE

APA

Desobry, F., Davy, M., & Doncarli, C. (2005). An online Kernel change detection algorithm. IEEE Transactions on Signal Processing, 53(8), 2961–2974. https://doi.org/10.1109/TSP.2005.851098

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free