On the application of mixture AR hidden Markov models to text independent speaker recognition

1991 ◽  
Vol 39 (3) ◽  
pp. 563-570 ◽  
Author(s):  
N.Z. Tisby
Keyword(s):  
Hidden Markov Models ◽  
Speaker Recognition ◽  
Markov Models ◽  
Hidden Markov

scholarly journals Individual Identification Through Voice Using Mel-Frequency Cepstrum Coefficient (MFCC) and Hidden Markov Models (HMM) Method

2020 ◽  
Vol 7 (1) ◽  
pp. 26
Author(s):  
Dea Sifana Ramadhina ◽  
Rita Magdalena ◽  
Sofia Saidah
Keyword(s):  
Hidden Markov Models ◽  
Speaker Recognition ◽  
Speech Signal ◽  
Markov Models ◽  
Hidden Markov ◽  
Recognition System ◽  
Individual Identification ◽  
Acoustic Speech Signal ◽  
Mel Frequency Cepstrum Coefficient ◽  
The Voice

Voice is one of the parameters in the identification process of a person. Through the voice, information will be obtained such as gender, age, and even the identity of the speaker. Speaker recognition is a method to narrow down crimes and frauds committed by voice. So that it will minimize the occurrence of faking one's identity. The Method of Mel Frequency Cepstrum Coefficient (MFCC) can be used in the speech recognition system. The process of feature extraction of speech signal using MFCC will produce acoustic speech signal. The classification, Hidden Markov Models (HMM) is used to match unidentified speaker’s voice with the voices in database. In this research, the system is used to verify the speaker, namely 15 text dependent in Indonesian. On testing the speaker with the same as database, the highest accuracy is 99,16%.

scholarly journals Sistem Pengenalan Pembicara dengan Metode Wavelet-MCFF dan Pengklasifikasi Hidden Markov Models (HMM)

2021 ◽  
Vol 8 (1) ◽  
pp. 119
Author(s):  
Syahroni Hidayat ◽  
Andi Sofyan Anas ◽  
Siti Agrippina Alodia Yusuf ◽  
Muhammad Tajuddin
Keyword(s):  
Hidden Markov Models ◽  
Speaker Recognition ◽  
Markov Models ◽  
Hidden Markov ◽  
Digital Signal ◽  
Recognition System ◽  
Level 1 ◽  
New Feature ◽  
Dyadic Decomposition ◽  
Mel Frequency Cepstral Coefficient

<p class="Abstrak">Penelitian pengolahan sinyal digital yang berfokus pada pengenalan pembicara telah dimulai sejak beberapa dekade yang lalu, dan telah menghasilkan banyak metode-metode pengenalan pembicara. Di antara algoritma pembentukan koefisien ciri yang telah dikembangkan tersebut, ada dua algoritma yang dapat memberikan akurasi yang tinggi jika diterapkan pada sistem, yaitu <em>Mel Frequency Cepstral Coefficient</em> (MFCC) dan <em>Wavelet</em>. Penelitian ini bertujuan untuk menguji dan memilih kanal terbaik dari proses <em>wavelet</em>-MFCC yang dapat dijadikan sebagai koefisien ciri baru untuk diterapkan pada sistem pengenal pembicara. Koefisien ciri baru tersebut kemudian disebut dengan koefisien ciri <em>Wavelet</em>-MFCC. Kofisien ini dibentuk dari merubah kanal hasil dekomposisi <em>wavelet</em>, yaitu kanal aproksimasi (cA), kanal detail (cD), dan penggabungannya (cAcD), menjadi koefisien MFCC. Metode dekomposisi <em>wavelet</em> yang digunakan adalah metode <em>dyadic</em> dengan menerapkan <em>level</em> dekomposisi <em>level</em> 1 dan <em>level</em> 2. Setiap koefisien ciri kemudian menjadi inputan pada sistem pengklasifikasi <em>Hidden Markov Models</em> (HMM). Keluaran dari HMM kemudian dihitung akurasinya dan dianalisis. Dari pengujian yang dilakukan, diperoleh bahwa kanal detail (cD) sebagai ciri dapat memberikan akurasi yang sama dengan menggunakan kanal gabungan (cAcD) dan lebih tinggi dari kanal aproksimasi (cA), dengan akurasi sebesar 95%. Hal ini menunjukkan bahwa, kanal detail pada dekomposisi <em>level</em> 1 menyimpan ciri suara dari setiap pembicara sehingga sudah cukup untuk dijadikan sebagai koefisien ciri. Maka, penggunaan dekomposisi <em>level</em> 1 dan kanal detail cD sebagai ciri <em>Wavelet</em>-<em>MFCC</em> pada sistem pengenalan pembicara dapat meringankan dan mempercepat proses komputasi.</p><p class="Abstrak"> </p><p class="Abstrak"><em><strong>Abstract</strong></em></p><p class="Abstract"><em>Research in digital signal that focused on speaker recognition has begun since decades ago, and has resulted many speaker recognition methods. there are two algorithms that can provide high accuracy in recognition system, which are Mel Frequency Cepstral Coefficient (MFCC) and Wavelet. the aims of this study is to examine and chose the best channel from wavelet-MFCC process that can be used as new feature coefficient, then called as Wavelet-MFCC features coefficient. The coefficient is built by converting the wavelet decomposition channels, which are approximation (cA), detail (cD), and its combination (cAcD), into the MFCC coefficient. Wavelet dyadic decomposition with level 1 and level 2 of decomposition is applied. Each feature coefficient acts as an input to the HMM classifier. The accuracy of the HMM output is calculated, then analyzed. The obtained results show that the detail chanel (cD) achieve equal accuracy as the combination chanel (cAcD), and higher accuracy compared to aproximation channel (cA), with accuracy 95%. Thus, it can be conclude that the detail channel on level 1 decomposition contains features of each speaker's. Then, cD is enough to be used as a Wavelet-MFCC feature. Thus, its implementation in the SRS can ease and speed up the computing process.</em></p><p class="Abstrak"><em><strong><br /></strong></em></p>

Estimating Personality Impression from Speech Record Using Hidden Markov Models

2015 ◽  
Vol 135 (12) ◽  
pp. 1517-1523 ◽  
Author(s):  
Yicheng Jin ◽  
Takuto Sakuma ◽  
Shohei Kato ◽  
Tsutomu Kunitachi
Keyword(s):  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov

Hidden Markov Processes

2014 ◽  
Author(s):  
M. Vidyasagar
Keyword(s):  
Hidden Markov Models ◽  
Markov Processes ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Local Alignment ◽  
Biological Applications ◽  
Standard Material ◽  
Hidden Markov Processes ◽  
Genomics And Proteomics

This book explores important aspects of Markov and hidden Markov processes and the applications of these ideas to various problems in computational biology. It starts from first principles, so that no previous knowledge of probability is necessary. However, the work is rigorous and mathematical, making it useful to engineers and mathematicians, even those not interested in biological applications. A range of exercises is provided, including drills to familiarize the reader with concepts and more advanced problems that require deep thinking about the theory. Biological applications are taken from post-genomic biology, especially genomics and proteomics. The topics examined include standard material such as the Perron–Frobenius theorem, transient and recurrent states, hitting probabilities and hitting times, maximum likelihood estimation, the Viterbi algorithm, and the Baum–Welch algorithm. The book contains discussions of extremely useful topics not usually seen at the basic level, such as ergodicity of Markov processes, Markov Chain Monte Carlo (MCMC), information theory, and large deviation theory for both i.i.d and Markov processes. It also presents state-of-the-art realization theory for hidden Markov models. Among biological applications, it offers an in-depth look at the BLAST (Basic Local Alignment Search Technique) algorithm, including a comprehensive explanation of the underlying theory. Other applications such as profile hidden Markov models are also explored.

Sign in / Sign up

Export Citation Format

Share Document