878 resultados para Speech Recognition System using MFCC


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Four types of neural networks which have previously been established for speech recognition and tested on a small, seven-speaker, 100-sentence database are applied to the TIMIT database. The networks are a recurrent network phoneme recognizer, a modified Kanerva model morph recognizer, a compositional representation phoneme-to-word recognizer, and a modified Kanerva model morph-to-word recognizer. The major result is for the recurrent net, giving a phoneme recognition accuracy of 57% from the si and sx sentences. The Kanerva morph recognizer achieves 66.2% accuracy for a small subset of the sa and sx sentences. The results for the word recognizers are incomplete.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Speech recognition systems typically contain many Gaussian distributions, and hence a large number of parameters. This makes them both slow to decode speech, and large to store. Techniques have been proposed to decrease the number of parameters. One approach is to share parameters between multiple Gaussians, thus reducing the total number of parameters and allowing for shared likelihood calculation. Gaussian tying and subspace clustering are two related techniques which take this approach to system compression. These techniques can decrease the number of parameters with no noticeable drop in performance for single systems. However, multiple acoustic models are often used in real speech recognition systems. This paper considers the application of Gaussian tying and subspace compression to multiple systems. Results show that two speech recognition systems can be modelled using the same number of Gaussians as just one system, with little effect on individual system performance. Copyright © 2009 ISCA.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Large margin criteria and discriminative models are two effective improvements for HMM-based speech recognition. This paper proposed a large margin trained log linear model with kernels for CSR. To avoid explicitly computing in the high dimensional feature space and to achieve the nonlinear decision boundaries, a kernel based training and decoding framework is proposed in this work. To make the system robust to noise a kernel adaptation scheme is also presented. Previous work in this area is extended in two directions. First, most kernels for CSR focus on measuring the similarity between two observation sequences. The proposed joint kernels defined a similarity between two observation-label sequence pairs on the sentence level. Second, this paper addresses how to efficiently employ kernels in large margin training and decoding with lattices. To the best of our knowledge, this is the first attempt at using large margin kernel-based log linear models for CSR. The model is evaluated on a noise corrupted continuous digit task: AURORA 2.0. © 2013 IEEE.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Among the functional nucleic acids studied, adenine-rich nucleic acids have attracted attention due to their critical roles in many biological processes and self-assembly-based nanomaterials, especially deoxyribonucleic acids (abbreviated as poly(dA)). Therefore the ligands binding to poly(dA) might serve as potential therapeutic agents. Coralyne, a kind of planar alkaloid, has been firstly found that it could bind strongly to poly(dA). This work herein reports an approach for visual sensing of the coralyne-poly(dA) interaction. This method was based on the coralyne inducing poly(dA) into the homo-adenine DNA duplex and the difference in electrostatic affinity between single-stranded DNA and double-stranded DNA with gold nanoparticles (GNPs). Furthermore, we applied the recognition process of the interaction between coralyne and poly(dA) into specific coralyne detection with the assistance of certain software (such as Photoshop). A linear response from 0 to 728 nM was obtained for coralyne, and a detection limit of 91 nM was achieved.