Close Speakers Model and Comparative Study in Automatic Speaker Verification

نویسندگان

  • Djellali Hayet
  • Laskri Mohamed Tayeb
چکیده

The performance of speaker verification system degrades when the test segments are utterances of short duration, therefore, we investigate the use of model representing our target speaker with his close speaker and his own speech data. We propose to create a new Speaker Model who groups close speakers (CS) achieved with two clustering algorithms in Automatic Speaker Verification A.S.V. Intra and Inter speaker’s variability are two clustering algorithm used in voice module. We compare the traditional approach which uses one specific customer model (Maximum a Posteriori Adaptation) with the Close Speaker model (Customers Families).Close Speaker Model (CSM) applied only when speaker model is weak achieves 42% of equal error rate. The results demonstrate that the log likelihood of close speakers is greater than the likelihood of client speaker. The false alarm from client and CSM are closest and we are constrained to enhance speaker model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Objective Peak-Detection in Complex Auditory Brainstem Response to /ba/, /da/, /ga/: A Novel Technique

Objectives: The result of auditory brainstem response is used worldwide for detecting hearing impairments or hearing aids. This study aimed to introduce the superiority of mathematical innovation algorithm toward subjective evaluation by an audiologist. The automatic algorithm method is encouraged for detecting the waves of Auditory Brainstem Response (ABR), because it can reduce subjective eva...

متن کامل

Using Vector Quantization for Universal Background Model in Automatic Speaker Verification

We aim to describe different approaches for vector quantization in Automatic Speaker Verification. We designed our novel architecture based on multiples codebook representing the speakers and the impostor model called universal background model and compared it to another vector quantization approach used for reducing training data. We compared our scheme with the baseline system, Gaussian Mixtu...

متن کامل

On Word Boundary Detection in Digit-based Speaker Verification

In an automatic speaker verification (ASV) system with prompted passwords, we use vocabulary-dependent hidden Markov models and rely on the ability to explicitly locate the corresponding words and their boundaries in the speech signal. In an experiment on 41 speakers in a Swedish telephone speech database, we compare the use of utterance segmentation produced by automatic and manual methods, an...

متن کامل

Investigation of Speaker-Clustered UBMs based on Vocal Tract Lengths and MLLR matrices for Speaker Verification

It is common to use a single speaker independent large Gaussian Mixture Model based Universal Background Model (GMMUBM) as the alternative hypothesis for speaker verification tasks. The speaker models are themselves derived from the UBM using Maximum a Posteriori (MAP) adaptation technique. During verification, log likelihood ratio is calculated between the target model and the GMM-UBM to accep...

متن کامل

Text-independent speaker verification using virtual speaker based cohort normalization

In this paper, we propose a new score normalization method for text-independent speaker verification using GMM (Gaussian Mixture Model). In the proposed method, cohort model is designed as virtual speaker model based on the similarity of local acoustic information between the reference speaker and other customers. The similarity is determined using statistical distance between model components ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012