By Topic

Information Distance-Based Subvector Clustering for ASR Parameter Quantization

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)
Gue Jun Jung ; Korea Adv. Inst. of Sci. & Technol., Daejeon ; Yung-Hwan Oh

In this letter, we propose a new data-driven subvector clustering technique for parameter quantization in automatic speech recognition (ASR). Previous methods such as Greedy-n m-let and maximum clique partition have been proven to be effective. However, the former yields subvectors of equal sizes while the latter cannot determine the number of subvectors. In our method, we define a new object function based on information distance (ID) and optimize this using the cross-entropy (CE) method to overcome both of the aforementioned limitations. We compare the ASR performances using the Resource Management (RM) and Wall Street Journal (WSJ0) speech recognition tasks and show that the proposed technique performs better than previous heuristic techniques.

Published in:

Signal Processing Letters, IEEE  (Volume:15 )