Topic
Dynamic time warping
About: Dynamic time warping is a research topic. Over the lifetime, 6013 publications have been published within this topic receiving 133130 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Experimental results demonstrate that the proposed approach can effectively diagnose bearing faults under both variable working conditions and different fault severities.
74 citations
23 Aug 2010
TL;DR: The overall performance of the system was 96% for both legal and intruder situations is verified for MIT-BIH normal database size of 375 recording from 15 individual ECG.
Abstract: This paper proposes a new approach for person identification and novel person authentication using single lead human Electrocardiogram. Nine Feature parameters were extracted from ECG in spatial domain for classification. For person identification, Dynamic Time Warping (DTW) and Fisher’s Linear Discriminant Analysis (FLDA) with K-Nearest Neighbor Classifier (NNC) as single stage classification yielded a recognition accuracy of 96% and 97% respectively. To further improve the performance of the system, two stage classification techniques have been adapted. In two stage classifications FLDA is used with k-NNC at the first stage followed by DTW classifier at the second stage which yielded 100% recognition accuracy. During person authentication we adapted the QRS complex based threshold technique. The overall performance of the system was 96% for both legal and intruder situations is verified for MIT-BIH normal database size of 375 recording from 15 individual ECG.
74 citations
TL;DR: A connected digit recognizer is proposed in which a set of isolated word templates is used as reference patterns and an unconstrained dynamic time warping algorithm is used to literally "spot" the digits in the string.
Abstract: A connected digit recognizer is proposed in which a set of isolated word templates is used as reference patterns and an unconstrained dynamic time warping (DTW) algorithm is used to literally "spot" the digits in the string. Segmentation boundaries between digits are obtained as the termination point of the dynamic path from the previous time warp. A region around the boundary is searched for the optimum starting point for the succeeding digit. At each stage the recognizer keeps track of a set of candidate digit strings for each test string. The string with the smallest accumulated distance is used as the preliminary string estimate. To help improve the recognition accuracy, two "post-correction" techniques were applied to the entire set of hypothesized digit strings. One technique creates a reference string by concatenating reference contours of the digits of the string, and comparing this to the test string using a constrained dynamic time warping algorithm. The second technique performs a similar comparison using voiced-unvoiced-silence contours instead of the measured features. Small but consistent improvements in recognition accuracy have been obtained using these techniques for both speaker-trained and speaker-independent systems with digit strings recorded over dialed-up telephone lines. For variable length digit strings of from 2 to 5 digits (where the recognizer was not told the length of the string), word error rates of about 2-3 percent and string error rates on the order of 8 percent were obtained for both speaker-dependent and speaker-independent systems.
74 citations
Proceedings Article•
01 Jan 2003
TL;DR: In this article, the authors evaluated various query-by-humming (QBH) search systems and found that natural queries from two sources led to lower performance than that typically reported in the QBH literature.
Abstract: Evaluating music information retrieval systems is acknowledged to be a difficult problem. We have created a database and a software testbed for the systematic evaluation of various query-by-humming (QBH) search systems. As might be expected, different queries and different databases lead to wide variations in observed search precision. “Natural” queries from two sources led to lower performance than that typically reported in the QBH literature. These results point out the importance of careful measurement and objective comparisons to study retrieval algorithms. This study compares search algorithms based on note-interval matching with dynamic programming, fixed-frame melodic contour matching with dynamic time warping, and a hidden Markov model. An examination of scaling trends is encouraging: precision falls off very slowly as the database size increases. This trend is simple to compute and could be useful to predict performance on larger databases.
74 citations
TL;DR: A novel approach for estimating the global motion between frames using a curve warping technique known as dynamic time warping, which guarantees robustness also in presence of sharp illumination changes and moving objects.
Abstract: The widespread diffusion of hand-held devices with video recording capabilities requires the adoption of reliable digital Stabilization methods to enjoy the acquired sequences without disturbing jerkiness. In order to effectively get rid of the unwanted camera movements, an estimate of the global motion between adjacent frames is necessary. This paper presents a novel approach for estimating the global motion between frames using a curve warping technique known as dynamic time warping. The proposed algorithm guarantees robustness also in presence of sharp illumination changes and moving objects.
74 citations