Fast search algorithm for vq-based recognition of isolated word

This paper presents a fast search algorithm for vector quantisation (VQ)-based recognition of isolated words. It incorporates the property of high correlation between speech feature vectors of consecutive frames with the method of triangular inequality elimination to relieve the computational burden of vector-quantising the test feature vectors by full codebook search, and uses the extended partial distortion method to compress the incomplete matching computations of wildly mismatched words. Overall computational load can therefore be drastically reduced while the recognition performance of full search can be retained. Experimental results show that about 93% of multiplications and additions can be saved with a little increase of both comparisons and memory space.

[1]  Laveen N. Kanal,et al.  Analysis of k-nearest neighbor branch and bound rules , 1986, Pattern Recognit. Lett..

[2]  E. Ruiz.  An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .

[3]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[4]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[5]  Robert M. Gray,et al.  An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization , 1985, IEEE Trans. Commun..

[6]  Matti Karjalainen.  Speech communication, human and machine: by Douglas O'Shaughnessy, INRS-Telecommunication. Publisher: Addison-Wesley Publishing Company, Route 128, Reading, MA 01867, U.S.A., 1987, xviii+568 pp., ISBN 0-201-16520-1 , 1988 .

[7]  Allen Gersho,et al.  A fast codebook search algorithm for nearest-neighbor pattern matching , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Behrooz Kamgar-Parsi,et al.  An improved branch and bound algorithm for computing k-nearest neighbors , 1985, Pattern Recognit. Lett..

[9]  Salvatore D. Morgera,et al.  A high-speed search algorithm for vector quantization , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  Allen Gersho,et al.  Fast search algorithms for vector quantization and pattern matching , 1984, ICASSP.

[11]  John E. Shore,et al.  Discrete utterance speech recognition without time alignment , 1983, IEEE Trans. Inf. Theory.

[12]  L. Rabiner,et al.  An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[13]  Heinrich Niemann,et al.  An efficient branch-and-bound nearest neighbour classifier , 1988, Pattern Recognition Letters.

[14]  E. J.,et al.  Isolated-Word Speech Recognition Using Multi-Section Vector Quantization Code , .

[15]  D. O'Shaughnessy,et al.  Speaker recognition , 1986, IEEE ASSP Magazine.

[16]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[17]  Ieee Lawrence R. Rabiner Fellow,et al.  Isolated and Connected Word Recognition—Theory and Selected Applications , 1990 .