All Categories


Pages


FEATURE MATCHING BY SKPCA WITH UNSUPERVISED ALGORITHM AND MAXIMUM PROBABILITY IN SPEECH RECOGNITION

Abstract: A Speech recognition system requires a combination of various techniques and algorithms, each of which performs a specific task for achieving the main goal of the system. Speech recognition performance can be enhanced by selecting the proper acoustic model. In this work, the feature extraction and matching is done by SKPCA with Unsupervised learning algorithm and maximum probability. SKPCA reduces the data maximization of the model. It represents a sparse solution for KPCA, because the original data can be reduced considering the weights, i.e., the weights show the vectors which most influence the maximization. Unsupervised learning algorithm is implemented to find the suitable representation of the labels and maximum probability is used to maximize the normalized acoustic likelihood of the most likely state sequences of training data. The experimental results show the efficiency of SKPCA technique with the proposed approach and maximum probability produce the great performance in the speech recognition system.    

Keywords: Microfinance, women’s empowerment, Non Governmental Organization, Self Help groups.

Click Here to View Full Paper




About the Author


M.Pavithra, G.Chinnasamy, Azha.Periasamy, and S.Muruganand

Department of Electronics and Instrumentation, Bharathiar University.


Comments


No comments yet! Be the first:

Your Response



Most Viewed - All Categories

Web
Analytics Made Easy - StatCounter