Times Series Averaging and Denoising from a Probabilistic Perspective on Time–Elastic Kernels
Open Access
- 1 June 2019
- journal article
- research article
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 29 (2) , 375-392
Abstract
In the light of regularized dynamic time warping kernels, this paper re-considers the concept of a time elastic centroid for a set of time series. We derive a new algorithm based on a probabilistic interpretation of kernel alignment matrices. This algorithm expresses the averaging process in terms of stochastic alignment automata. It uses an iterative agglomerative heuristic method for averaging the aligned samples, while also averaging the times of their occurrence. By comparing classification accuracies for 45 heterogeneous time series data sets obtained by first nearest centroid/medoid classifiers, we show that (i) centroid-based approaches significantly outperform medoid-based ones, (ii) for the data sets considered, our algorithm, which combines averaging in the sample space and along the time axes, emerges as the most significantly robust model for time-elastic averaging with a promising noise reduction capability. We also demonstrate its benefit in an isolated gesture recognition experiment and its ability to significantly reduce the size of training instance sets. Finally, we highlight its denoising capability using demonstrative synthetic data. Specifically, we show that it is possible to retrieve, from few noisy instances, a signal whose components are scattered in a wide spectral band.Keywords
This publication has 27 references indexed in Scilit:
- Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignmentTheoretical Computer Science, 2012
- A global averaging method for dynamic time warping, with applications to clusteringPattern Recognition, 2011
- Reducing noise by repetition: introduction to signal averagingEuropean Journal of Physics, 2010
- On The Marriage of Lp-norms and Edit Distance2004
- Computational Complexity of Multiple Sequence Alignment with SP-ScoreJournal of Computational Biology, 2001
- On the Complexity of Multiple Sequence AlignmentJournal of Computational Biology, 1994
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Digital signal averagingJournal of Magnetic Resonance (1969), 1979
- Automatic recognition of 200 wordsInternational Journal of Man-Machine Studies, 1970
- Sur quelques points du calcul fonctionnelRendiconti del Circolo Matematico di Palermo Series 2, 1906