Information distance-based subvector clustering for ASR parameter quantization

Cited 1 time in webofscience Cited 1 time in scopus
  • Hit : 508
  • Download : 213
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2008
Language
English
Article Type
Article
Citation

IEEE SIGNAL PROCESSING LETTERS, v.15, pp.209 - 212

ISSN
1070-9908
DOI
10.1109/LSP.2007.913132
URI
http://hdl.handle.net/10203/17268
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0