PRESENTATION OF K NEAREST NEIGHBOR GAUSSIAN INTERPOLATION AND COMPARING IT WITH FUZZY INTERPOLATION IN SPEECH RECOGNITION

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAYADIYAN A.; BADI K.; MOEIN M.; MOGHADAM N.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2005 | Volume:23 | Issue:2 Page(s): 1-10

Download Full-Text

Persian Verion

View:

827

Download:

Cites:

Information Journal Paper

Title

PRESENTATION OF K NEAREST NEIGHBOR GAUSSIAN INTERPOLATION AND COMPARING IT WITH FUZZY INTERPOLATION IN SPEECH RECOGNITION

Author(s)

SAYADIYAN A. | BADI K. | MOEIN M. | MOGHADAM N. | Issue Writer Certificate

Keywords

GAUSSIAN INTERPOLATIONQ4

FUZZYQ4

LNTERPOLATIONQ4

DISCRETE DENSITY HMMQ4

DISCRETE UTTERANCE RECOGNTIONQ4

Abstract

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than DISCRETE DENSITY HMM, but its computation complexity is very high, especially in very large discrete utterance recognition problems. For real time implementation of very large discrete utterance recognition, we must use DISCRETE DENSITY HMM (DDHMM). To increase the performance of DDHMM, one usual solution is FUZZY interpolation. In this study, we present a new method named GAUSSIAN INTERPOLATION. We implemented and compared the performance of two types of interpolation methods for 1500 Persian speech command words. Results show that precision and flexibility of GAUSSIAN INTERPOLATION is better thanthose of the FUZZY interpolation.

Cites

No record.

References

No record.

Cite

APA: Copy

SAYADIYAN, A., BADI, K., MOEIN, M., & MOGHADAM, N.. (2005). PRESENTATION OF K NEAREST NEIGHBOR GAUSSIAN INTERPOLATION AND COMPARING IT WITH FUZZY INTERPOLATION IN SPEECH RECOGNITION. ESTEGHLAL, 23(2), 1-10. SID. https://sid.ir/paper/5952/en

Vancouver: Copy

SAYADIYAN A., BADI K., MOEIN M., MOGHADAM N.. PRESENTATION OF K NEAREST NEIGHBOR GAUSSIAN INTERPOLATION AND COMPARING IT WITH FUZZY INTERPOLATION IN SPEECH RECOGNITION. ESTEGHLAL[Internet]. 2005;23(2):1-10. Available from: https://sid.ir/paper/5952/en

IEEE: Copy

A. SAYADIYAN, K. BADI, M. MOEIN, and N. MOGHADAM, “PRESENTATION OF K NEAREST NEIGHBOR GAUSSIAN INTERPOLATION AND COMPARING IT WITH FUZZY INTERPOLATION IN SPEECH RECOGNITION,” ESTEGHLAL, vol. 23, no. 2, pp. 1–10, 2005, [Online]. Available: https://sid.ir/paper/5952/en

Related Journal Papers