• 한국음향학회지
• /
• 제3권1호
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• 한국컴퓨터정보학회논문지
• /
• 제16권2호
• /
• pp.61-69
• /
• 2011

동적계획법이 기반인 Dynamic Time Warping은 두 패턴의 유사도를 비교하기 위해 널리 사용되는 방법이다. DTW알고리즘에는 2가지 알려진 문제점이 있다. 첫 번째 문제는 DTW알고리즘은 2개의 패턴의 대응경로를 계산하면서 특이점이 발생하는 문제가 발생하게 된다. 두 번째 문제는 동적패턴의 대응경로가 올바른지 알 수 없다는 문제가 있다. 이에 본 논문에서는 DTW알고리즘의 문제에 대한 효과적인 해결을 위하여, 2차 미분 연산자를 적용한 DTW알고리즘을 제안 한다. 2차 미분 연산자의 하나인 "라플라시안오브가우시안" 연산자를 적용하여, 효과적으로 특이점에 대한 문제를 해결하고, 올바른 대응경로를 가질 수 있는 방법에 대하여 제안하고, 실험의 결과로 제안하는 알고리즘의 우수성을 증명한다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제37권7호
• /
• pp.584-589
• /
• 2010

시계열 패턴 인식에 일반적으로 많이 사용되는 동적인 타임 워핑 알고리즘은 대부분의 연산시간을 상관표를 작성하는데 소비한다. 그리고 이 연산시간을 줄이고자 전역 경로 제약조건을 설정하여 연산범위에 제한을 두는데, 이것은 패턴의 내용을 고려하지 않은 시간축에 의한 제한이다. 따라서 본 논문에서는 패턴의 형태에 따라 적응적으로 전역 경로 제약조건을 설정하여 보다 효율적으로 패턴인식을 수행하는 분기 한정적인 동적 타임 워핑 알고리즘을 제안한다. 제안된 방법의 성능 평가를 위한 실험에서는 분기 한정적인 동적 타임 워핑 알고리즘이 기존의 동적 타임 워핑 방법과 경로 거리는 유사하면서 연산 시간이 보다 개선되었음을 확인할 수 있었다.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.851-876
• /
• 2018

Dynamic time warping (DTW) is the main algorithms for time series alignment. However, it is unsuitable for quasi-periodic time series. In the current situation, except the recently published the shape exchange algorithm (SEA) method and its derivatives, no other technique is able to handle alignment of this type of very complex time series. In this work, we propose a novel algorithm that combines the advantages of the SEA and the DTW methods. Our main contribution consists in the elevation of the DTW power of alignment from the lowest level (Class A, non-periodic time series) to the highest level (Class C, multiple-periods time series containing different number of periods each), according to the recent classification of time series alignment methods proposed by Boucheham (Int J Mach Learn Cybern, vol. 4, no. 5, pp. 537-550, 2013). The new method (quasi-periodic dynamic time warping [QP-DTW]) was compared to both SEA and DTW methods on electrocardiogram (ECG) time series, selected from the Massachusetts Institute of Technology - Beth Israel Hospital (MIT-BIH) public database and from the PTB Diagnostic ECG Database. Results show that the proposed algorithm is more effective than DTW and SEA in terms of alignment accuracy on both qualitative and quantitative levels. Therefore, QP-DTW would potentially be more suitable for many applications related to time series (e.g., data mining, pattern recognition, search/retrieval, motif discovery, classification, etc.).

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.294-297
• /
• 2005

Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6063-6079
• /
• 2019

When the length of sampling data sequence is too large, the method of gesture recognition based on traditional Dynamic Time Warping (DTW) algorithm will lead to too long calculation time, and the accuracy of recognition result is not high.Support vector machine (SVM) has some shortcomings in precision, Edit Distance on Real Sequences(EDR) algorithm does not guarantee that noise suppression will not suppress effective data.A new method based on Improved Interpolation Dynamic Time Warping (IIDTW)algorithm is proposed to improve the efficiency of gesture recognition and the accuracy of gesture recognition. The results show that the computational efficiency of IIDTW algorithm is more than twice that of SVM-DTW algorithm, the error acceptance rate is FAR reduced by 0.01%, and the error rejection rate FRR is reduced by 0.5%.Gesture recognition based on IIDTW algorithm can achieve better recognition status. If it is applied to unlock mobile phone, it is expected to become a new generation of unlock mode.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
• /
• pp.290-291
• /
• 2008

The most popular speech feature used in speech recognition today is the Mel-Frequency Cepstral Coefficients (MFCC) algorithm, which could reflect the perception characteristics of the human ear more accurately than other parameters. This paper adopts MFCC and its first order difference, which could reflect the dynamic character of speech signal, as synthetical parametric representation. Furthermore, we quote Dynamic Time Warping (DTW) algorithm to search match paths in the pattern recognition process. We use the software "GoldWave" to record English digitals in the lab environments and the simulation results indicate the algorithm has higher recognition accuracy than others using LPCC, etc. as character parameters in the experiment for Digital Isolated Word Recognition (DIWR) system.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.123-129
• /
• 2013

The aim of this study is to design an intelligent pattern-based real-time trading system (PRTS) using rough set analysis of technical indicators, dynamic time warping (DTW), and genetic algorithm in stock futures market. Rough set is well known as a data-mining tool for extracting trading rules from huge data sets such as real-time data sets, and a technical indicator is used for the construction of the data sets. To measure similarity of patterns, DTW is used over a given period. Through an empirical study, we identify the ideal performances that were profitable in various market conditions.

• 말소리와 음성과학
• /
• 제14권1호
• /
• pp.29-36
• /
• 2022

The English word-final /rl/ cluster poses a particular problem for Korean learners of English because it is the sequence of two sounds, /r/ and /l/, which are not contrastive in Korean. This study compared the similarity distances between English and Korean speakers' /rl/ productions using the dynamic time warping (DTW) algorithm. The words with /rl/ (pearl, world) and without /rl/ (bird, word) were recorded by four English speakers and four Korean speakers, and compared pairwise. The F2-F1 trajectories, the acoustic correlate of velarized /l/, and F3 trajectories, the acoustic correlate of /r/, were examined. Formant analysis showed that English speakers lowered F2-F1 values toward the end of a word, unlike Korean speakers, suggesting the absence of /l/ in Korean speakers. In contrast, there was no significant difference in F3 values. Mixed-effects regression analyses of the DTW distances revealed that Korean speakers produced /r/ similarly to English speakers but failed to produce the velarized /l/ in /rl/ clusters.

• 한국음향학회지
• /
• 제19권8호
• /
• pp.63-67
• /
• 2000

본 논문에서는 화자인식의 성능향상을 위한 dynamic time warping (DTW) 기반의 문맥 제시형 화자인식에 대해 연구하였다. 화자인식에 있어 중요한 요소인 화자의 특성을 잘 반영할 수 있는 참조패턴을 생성하기 위해 유전자 알고리즘을 적용하였다. 또한, 문맥 종속형과 문맥 독립형 화자인식의 단점을 개선하기 위해 문맥 제시형 화자인식을 수행하였다. Clos set에서 화자식별과 open set에서 화자확인 실험을 하였으며 실험결과 기존 방법의 참조패턴을 이용하였을 경우보다 유전자 알고리즘에 의한 참조패턴이 인식률과 인식속도 면에서 우수함을 보였다.