Though the concept of sample mean in dynamic time warping (DTW) spaces is used in pattern recognition applications, its existence has neither been proved nor called into question. This article shows that a sample mean exists under general conditions that cover common variations of different DTW-spaces mentioned in the literature. The existence proofs are based on a Reduction Theorem that bounds...

Classifications of several gesture types are very helpful in several applications. This paper tries to address fast classifications of hand gestures using DTW over multi-core simple processors. We presented a methodology to distribute templates over multi-cores and then allow parallel execution of the classification. The results were presented to voting algorithm in which the majority vote was ...

in a voice conversion system speech signal of a speaker (i.e. source speaker) is modified so that it sounds as if it had been pronounced by b speaker (i.e. target speaker). this process, sometimes, is called speaker conversion (changing speaker identity). achieved signal from speaker conversion system is desired to have high quality and very natural. to satisfy this, three major methods are pro...

Walking ability can be degraded by a number of pathologies, including movement disorders, stroke, and injury. Personal activity tracking devices gather inertial data needed to measure walking quality, but the required algorithmic methods are an active area of study. To detect changes in walking ability, the similarity between a person’s current gait cycles and their known baseline gait cycles m...

The technique of dynamic time warping (DTW) is relied on heavily in isolated word recognition systems. The advantage of using DTW is that reliable time alignment between reference and test patterns is obtained. The disadvantage of using DTW is the heavy computational burden required to find the optimal time alignment path. Several alternative procedures have been proposed for reducing the compu...

Subsequence similarity search is one of the basic problems of time series data mining. Nowadays Dynamic Time Warping (DTW) is considedered as the best similarity measure. However despite various existing software speedup techniques DTW is still computationally expensive. There are approaches to speed up DTW computation by means of parallel hardware (e.g. GPU and FPGA) but accelerators based on ...

In this paper we introduce a novel dynamic programming algorithm called Information Retrieval-based Dynamic Time Warping (IR-DTW) used to find non-linearly matching subsequences between two time series where matching start and end points are not known a priori. In this paper our algorithm is applied for audio matching within the query by example (QbE) spoken term detection (STD) task, although ...

In this paper we introduce a novel dynamic programming algorithm called Information Retrieval-based Dynamic Time Warping (IR-DTW) used to find non-linearly matching subsequences between two time series where matching start and end points are not known a priori. In this paper our algorithm is applied for audio matching within the query by example (QbE) spoken term detection (STD) task, although ...

Time series arise in many different applications in the form of sensor data, stocks data, videos, and other time-related information. Analysis of this data typically requires searching for similar time series in a database. Dynamic Time Warping (DTW) is a widely used high-quality distance measure for time series. As DTW is computationally expensive, efficient algorithms for fast computation are...