Principal Curve Time Warping

Time warping finds use in many fields of time series analysis, and it has been effectively implemented in many different application areas. Rather than focusing on a particular application area we approach the general problem definition, and employ principal curves, a powerful machine learning tool, to improve the noise robustness of existing time warping methods. The increasing noise level is the most important problem that leads to unnatural alignments. Therefore, we tested our approach in low signal-to-noise ratio (SNR) signals, and obtained satisfactory results. Moreover, for the signals denoised by principal curve projections we propose a differential equation-based time warping method, which has a comparable performance with lower computational complexity than the existing techniques.

[1]  Eamonn J. Keogh,et al.  Everything you know about Dynamic Time Warping is Wrong , 2004 .

[2]  Deniz Erdogmus,et al.  Local conditions for critical and principal manifolds , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Yizong Cheng,et al.  Mean Shift, Mode Seeking, and Clustering , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Donald J. Berndt,et al.  Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.

[5]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Deniz Erdogmus,et al.  Self-Consistent Locally Defined Principal Surfaces , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[7]  Hiroaki Sakoe,et al.  A Dynamic Programming Approach to Continuous Speech Recognition , 1971 .

[8]  E. Parzen.  On Estimation of a Probability Density Function and Mode , 1962 .

[9]  P. J. Green,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[10]  Adam Krzyzak,et al.  Learning and Design of Principal Curves , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  R. Tibshirani.  Principal curves revisited , 1992 .

[12]  L. Rabiner,et al.  A statical decision approach to the recognition of connected digits , 1976 .

[13]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[14]  IItevor Hattie.  Principal Curves and Surfaces , 1984 .

[15]  Pietro Perona,et al.  Self-Tuning Spectral Clustering , 2004, NIPS.

[16]  L. Rabiner,et al.  Statistical decision approach to the recognition of connected digits , 1976 .

[17]  Aaron E. Rosenberg,et al.  Performance tradeoffs in dynamic time warping algorithms for isolated word recognition , 1980 .

[18]  Eamonn J. Keogh,et al.  Derivative Dynamic Time Warping , 2001, SDM.

[19]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[20]  David Burshtein,et al.  An enhanced dynamic time warping model for improved estimation of DTW parameters , 2003, IEEE Trans. Speech Audio Process..

[21]  Sergios Theodoridis,et al.  Recognition of isolated musical patterns using Context Dependent Dynamic Time Warping , 2002, 2002 11th European Signal Processing Conference.

[22]  Adrian E. Raftery,et al.  Finding Curvilinear Features in Spatial Point Patterns: Principal Curve Clustering with Noise , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Sanjeev R. Kulkarni,et al.  Principal curves with bounded turn , 2002, IEEE Trans. Inf. Theory.

[24]  Dorin Comaniciu,et al.  An Algorithm for Data-Driven Bandwidth Selection , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Aaron E. Rosenberg,et al.  Considerations in dynamic time warping algorithms for discrete word recognition , 1978 .

[26]  Adam Krzyzak,et al.  Piecewise Linear Skeletonization Using Principal Curves , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  T. Hastie,et al.  Principal Curves , 2007 .

[28]  Robert Jenssen,et al.  Some Equivalences between Kernel Methods and Information Theoretic Methods , 2006, J. VLSI Signal Process..