Abstract
In this paper, a DTW-based graph theoretic method for feature subset selection of speech recognition and speaker recognition is discussed , and a DTW-based directed acyclic graph optimization method (DTWDAG) is proposed. We extend the Euclidean-distance based similarity matrix clustering method to DTW-based similarity matrix clustering, and construct a cost function according to similarity matrix. Combining the cost function with (l-r) optimization algorithm, the method is applied to the isolated digital speaker-dependent speech recognition and text-dependent speaker identification. The experiment results demonstrate the efficient performance of DTWDAG in feature subset selection processing.
| Original language | English |
|---|---|
| Pages (from-to) | 50-54 |
| Number of pages | 5 |
| Journal | Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence |
| Volume | 18 |
| Issue number | 1 |
| State | Published - Feb 2005 |
| Externally published | Yes |
Keywords
- (l-r) optimization algorithm
- Dynamic time warping
- Feature selection
- Similarity matrix
Fingerprint
Dive into the research topics of 'DTW-based feature selection for speech recognition and speaker recognition'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver