By Topic

Shift-tolerant K-subspaces for phoneme recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Duanpei Wu ; Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA ; Gowdy, J.N.

This paper presents a new high performance neural network architecture, shift-tolerant K-subspaces, for phoneme recognition. The architecture combines the time-delay design for phoneme recognition and the technique of MLP autoassociators. For each phoneme category, K time-delay linear autoassociators are constructed and trained with a proposed K-subspace clustering procedure, similar to the K-means algorithm, using speech data belonging to the phoneme category. This architecture with its non-classification training procedure provides an effective method for phoneme recognition. It avoids the drawback encountered in most conventional neural network based speech recognition systems that network output values do not represent candidate likelihoods. The architecture has obtained 87.37% recognition accuracy which is only slightly lower than 88.44% obtained with a TDNN and 88.30% with a shift-tolerant LVQ trained by classification learning procedures using the same data set

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996