Abstract
This paper reports on an optimum dynamic progxamming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using time-warping function. Then, two time-normalized distance definitions, called symmetric and asymmetric forms, are derived from the principle. These two forms are compared with each other through theoretical discussions and experimental studies. The symmetric form algorithm superiority is established. A new technique, called slope constraint, is successfully introduced, in which the warping function slope is restricted so as to improve discrimination between words in different categories. The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimental comparison with various DP-algorithms, previously applied to spoken word recognition by different research groups. The experiment shows that the present algorithm gives no more than about two-thirds errors, even compared to the best conventional algorithm.
Keywords
Normalization (sociology)Dynamic time warpingDynamic programmingAlgorithmConstraint (computer-aided design)Word (group theory)Computer scienceFunction (biology)MathematicsArtificial intelligence
Affiliated Institutions
Related Publications
Minimum prediction residual principle applied to speech recognition
A computer system is described in which isolated words, spoken by a designated talker, are recognized through calculation of a minimum prediction residual. A reference pattern f...
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
The combination of local search heuristics and genetic algorithms is a promising approach for finding near-optimum solutions to the traveling salesman problem (TSP). An approach...
Learning spatially localized, parts-based representation
In this paper, we propose a novel method, called local non-negative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual ...
Deterministic annealing for clustering, compression, classification, regression, and related optimization problems
The deterministic annealing approach to clustering and its extensions has demonstrated substantial performance improvement over standard supervised and unsupervised learning met...
Robustness against noise: The role of timing-synchrony measurement
In a previous report (Ghitza, 1987, [1]) we described a computational model based upon the temporal characteristics of the information in the auditory nerve fiber firing pattern...
Publication Info
- Year
- 1978
- Type
- article
- Volume
- 26
- Issue
- 1
- Pages
- 43-49
- Citations
- 6280
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6280
OpenAlex
Cite This
Hiroaki Sakoe,
Seibi Chiba
(1978).
Dynamic programming algorithm optimization for spoken word recognition.
IEEE Transactions on Acoustics Speech and Signal Processing
, 26
(1)
, 43-49.
https://doi.org/10.1109/tassp.1978.1163055
Identifiers
- DOI
- 10.1109/tassp.1978.1163055