|
|
|
| ANNEALING VECTOR QUANIZATION IN SPEECH RECOGNITION |
| Wang Ke①; Wang Cuimei② |
| ①Department of Radio Electronics Sichuan University Chengdu 610064;②Department of Computer Science Southwest Nationalities Institute of China Chengdu 610041 |
|
|
|
|
Abstract Vector quantization plays an important role in speech recognition.Traditional K-means algorithm owns the advantage of fast convergence, but it is difficult to get the global optimal result.Some modified algorithms have been proposed to overcome this drawback,but they also increase the computation greatly.In this papsr,a new algorithm which is based on annealing algorithm is proposed to compromise the contradiction.In the rest of the paper,the details of the algorithm and related experiments are given.The results demonstrate the algorithm is more effective than other methods.
|
|
Received: 11 June 1998
|
|
|
|
|
|
|
|
|
2000, Vol. 22 
