Welcome to IEEE Xplore 2.0: Dynamic time programming based on ant colony algorithm

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Dynamic time programming based on ant colony algorithm
Hai-Hua Chen Qing-Chun Meng
Dept. of Comput. Sci., Ocean Univ. of China, Qingdao, China;

This paper appears in: Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Publication Date: 26-29 Aug. 2004
Volume: 6, On page(s): 3557- 3562 vol.6
ISSN:
ISBN: 0-7803-8403-2
INSPEC Accession Number: 8254315
Current Version Published: 2005-01-24

Abstract
The random time changing behavior is very popular in speech signal. In order to correct it the warping method is often used in speech signal processing which based on template matching. Ant colony algorithm is a novel random optimization algorithm. It had shown many promising properties in solving complicated optimization problems. Applying the thought of ant colony algorithm to speech signal processing this paper presents a new dynamic time programming based on ant colony algorithm - ADTP. It uses both the global and the local characters of speech signal. The theoretic analysis and simulation experiments all certify the new algorithm feasibility. The matching results of the new method can show more accurate similarity between speech signals than the DTW method.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.