EKSTRAKSI CIRI SUARA UNTUK PENGENALAN IDENTITAS PEMBICARA MENGGUNAKAN MFCC DAN HIDDEN MARKOV MODELS
| Main Authors: | , Budi Darmawan, , Dr. Eng. Ir. Risanuri Hidayat, M.Sc. |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
[Yogyakarta] : Universitas Gadjah Mada
, 2011
|
| Subjects: | |
| Online Access: |
https://repository.ugm.ac.id/89607/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=51739 |
Daftar Isi:
- In this experiment developed a voice recognition system using Hidden Markov Models (HMM) type of left to right with Euclidean Distance-based method to calculate the probability of observation series. Sound recordings from 10 speakers, each saying the word "SAYA" 30 times. Each voice are split according to constituent letters, and extracted using FFT and MFCC feature with a number of different coefficients. The experimental results showed that in order to obtain an average accuracy rate of 90% or more, it takes a number of MFCC coefficients by 5 coefficients per state for the number of samples 2 people, 4 coefficients per state for the number of samples 3, 4 and 5 people, 3 coefficient per state for the number samples 6 and 7 people, and 5 coefficients per state for the number of samples 8, 9 and 10 people. And to get an accuracy of 100%, it takes 5 pieces of MFCC coefficients per state for the number of samples 2 to 4 people, 12 coefficients per state for the number of samples from 5 to 9. And for a number of samples 10 people, the highest accuracy of 99% with the number of MFCC coefficients of 12 per state. The experimental results also show that the MFCC feature extraction by using the number of coefficients per state as much as 5 coefficients has to give the average accuracy is better for all of the speakers compared using FFT which takes the number of samples 256 samples per state.