• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.373-376
• /
• 2007

This paper presents dynamic (on-line) signature verification using direction and speed information as feature information. We describe a detail method of the adjusted constant(W) in the suggested DTW for the speed between adjacent two points.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.1
• /
• pp.82-87
• /
• 2001

본 논문에서는 마우스 대신에 음성으로 명령을 입력하여 퍼지 추론을 통해 위도우 화면상의 커서를 이동시키는 인터페이스를 구현하였다. 입력된 음성이 대체로 짧은 언어이기에 이를 인식하기 위하여 고립단어 인식에 강한 DTW방식을 사용하였다. DTW방식의 단점중인 하나가 음성길이가 비슷한 명령을 입력하였을 때 표준패턴 중 오차 값이 가장 작은 패턴으로 인식하는 것이다. 예를 들면 \"아주 많이 이동해\"하는 음성이 입력되었을 때 비슷한 음성길이를 가진 \"아주 많이 오른쪽\"으로 인식하는 경우가 있다. 이런 오류를 해결하고자 각 패턴의 DTW오차 거리 값과 표준 패턴의 음성길이를 기준으로 임계값을 퍼지 추론하여 명령으로서의 수락 여부를 결정하였다. 판단이 애매한 부분은 사용자에게 질의를 하여 응답에 따라 수락 여부를 결정하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.665-670
• /
• 2006

This paper deals with a modified method of the dynamic time warping and feature points to extract various important information of the signature for the dynamic signature verification. We could achieve lower equal error rate, small and efficient feature points and fast processing time for the notification.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.221-225
• /
• 2008

In this paper, to avoid the frequency analysis requiring a high sampling rate, time-warped similarity measure algorithms, which are able to classify objects even with a low-rate sampling rate as time- series methods, are presented and proposed the DTW-Cosine algorithm, as the best classifier among them in wireless sensor networks. Two problems, local time shifting and spatial signal variation, should be solved to apply the time-warped similarity measure algorithms to wireless sensor networks. We find that our proposed algorithm can overcome those problems very efficiently and outperforms the other algorithms by at least 10.3% accuracy.

• Journal of Information Processing Systems
• /
• v.20 no.4
• /
• pp.491-500
• /
• 2024

In hopes of resolving the issue of poor quality of information input for teaching spoken English online, the study creates an English teaching assistance model based on a recognition algorithm named dynamic time warping (DTW) and relies on automated voice recognition technology. In hopes of improving the algorithm's efficiency, the study modifies the speech signal's time-domain properties during the pre-processing stage and enhances the algorithm's performance in terms of computational effort and storage space. Finally, a simulation experiment is employed to evaluate the model application's efficacy. The study's revised DTW model, which achieves recognition rates of above 95% for all phonetic symbols and tops the list for cloudy consonant recognition with rates of 98.5%, 98.8%, and 98.7% throughout the three tests, respectively, is demonstrated by the study's findings. The enhanced model for DTW voice recognition also presents higher efficiency and requires less time for training and testing. The DTW model's KS value, which is the highest among the models analyzed in the KS value analysis, is 0.63. Among the comparative models, the model also presents the lowest curve position for both test functions. This shows that the upgraded DTW model features superior voice recognition capabilities, which could significantly improve online English education and lead to better teaching outcomes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.21-28
• /
• 2010

This paper reports an experimental result on optimizing dissimilarity-based classification(DBC) by simultaneously using a dynamic time warping(DTW) and a multiple fusion strategy(MFS). DBC is a way of defining classifiers among classes; they are not based on the feature measurements of individual samples, but rather on a suitable dissimilarity measure among the samples. In DTW, the dissimilarity is measured in two steps: first, we adjust the object samples by finding the best warping path with a correlation coefficient-based DTW technique. We then compute the dissimilarity distance between the adjusted objects with conventional measures. In MFS, fusion strategies are repeatedly used in generating dissimilarity matrices as well as in designing classifiers: we first combine the dissimilarity matrices obtained with the DTW technique to a new matrix. After training some base classifiers in the new matrix, we again combine the results of the base classifiers. Our experimental results for well-known benchmark databases demonstrate that the proposed mechanism achieves further improved results in terms of classification accuracy compared with the previous approaches. From this consideration, the method could also be applied to other high-dimensional tasks, such as multimedia information retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.61-69
• /
• 2011

Dynamic Time Warping based on Dynamic Programming is the one of the most widely been used to compare the similarity of two patterns. DTW algorithm has two known problems. The one is singularities. And the another problem is the accuracy of the warping path with patterns. Therefore, this paper suggest the solution for DTW algorithm to use a 2nd derivative operator. Laplacian of Gaussian is a kind of a 2nd derivative operator. Consequently, our suggestion method to apply to this operator, more efficient to solve the singularities problems and to secure a accuracy of the warping path. And the result shows a superior ability of this suggested method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.1-5
• /
• 2002

The purpose of this paper is developing a speech recognition module in a wheelchair for the sake of convenience. of the disability. For this system, we used TMS320C32 as a main processor; eliminated noise by applying Winer filler while considering characteristics of noise environment in pre-processing stage, and; extracted 12 feature patterns per france using LPC&Cepstrum. Then, we implemented the hybrid form combining DTW (Dynamic Time Warping), which is generally used for isolated words in the conventional algorithms, in the recognition Part, and NN (Neural network) to prevent any error of recognition. In this research, we achieved a recognition rate of more than 96% on isolated words when DTW and Hybrid forms were individually experimented in noise environment

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.543-552
• /
• 1994

Dynamic Time Warp(DTW) needs for iterative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at real time recognition design enables large dictionary hardware realization using DTW algorithm. The DTW PE cell separated into three large blocks. "MIN" is the one block for counting accumulated minimum distance. "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. Circuit design and verification about the three block have been accomplished, and performed layout '||'&'||' DRC(design rule check) using 1.2 m CMOS N-Well rule base.CMOS N-Well rule base.