Share Email Print
cover

Proceedings Paper

Development of fast approximation of Karhunen-Loeve transform for problems of speechlike signal recognition
Author(s): Alexander M. Krot; Nataly N. Prokudina
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of speech recognition becomes more and more important now. And one of the difficult tasks in that problem is the transformation of an initial signal to set of parameters to be recognized. The optimum orthogonal transform which is the best preserve information is given by the augmented eigenvectors of the data domain covariance matrix. Such transformation, commonly called the Karhunen- Loeve transformation (KLT) is too complex to be installed into speech processing system. By imposing of some restrictions to the input signal, it is possible to simplify calculation of KLT by its reduction to another transformation, which is easily calculated. Moreover, these restrictions allow to use fast algorithms for calculation. Such technique was applied to reach speech signal and correctness of imposed restrictions was proved. The technique of transformation of speech signal into sequence of parameters has been developed and experimentally proved.

Paper Details

Date Published: 4 April 1997
PDF: 8 pages
Proc. SPIE 3077, Applications and Science of Artificial Neural Networks III, (4 April 1997); doi: 10.1117/12.271507
Show Author Affiliations
Alexander M. Krot, Institute of Engineering Cybernetics (Belarus)
Nataly N. Prokudina, Institute of Engineering Cybernetics (Belarus)


Published in SPIE Proceedings Vol. 3077:
Applications and Science of Artificial Neural Networks III
Steven K. Rogers, Editor(s)

© SPIE. Terms of Use
Back to Top