AFRL/HECP Speaker Recognition Systems for the 2004 NIST Speaker Recognition Evaluation

2004 ◽  
Author(s):  
Raymond E. Slyh ◽  
Eric G. Hansen ◽  
Timothy R. Anderson
Keyword(s):  
Speaker Recognition ◽  
Recognition Systems

scholarly journals Performance Evaluation of Mel and Bark Scale based Features for Text-Independent Speaker Identification

2019 ◽  
Vol 8 (11) ◽  
pp. 3734-3738
Keyword(s):  
Speaker Recognition ◽  
Filter Bank ◽  
Work Performance ◽  
Speaker Identification ◽  
Recognition Rate ◽  
Identification System ◽  
Bank Structure ◽  
Speech Features ◽  
Recognition Systems ◽  
Human Ear

The performance of Mel scale and Bark scale is evaluated for text-independent speaker identification system. Mel scale and Bark scale are designed according to human auditory system. The filter bank structure is defined using Mel and Bark scales for speech and speaker recognition systems to extract speaker specific speech features. In this work, performance of Mel scale and Bark scale is evaluated for text-independent speaker identification system. It is found that Bark scale centre frequencies are more effective than Mel scale centre frequencies in case of Indian dialect speaker databases. Mel scale is defined as per interpretation of pitch by human ear and Bark scale is based on critical band selectivity at which loudness becomes significantly different. The recognition rate achieved using Bark scale filter bank is 96% for AISSMSIOIT database and 95% for Marathi database.

scholarly journals U-Vectors: Generating Clusterable Speaker Embedding from Unlabeled Data

2021 ◽  
Vol 11 (21) ◽  
pp. 10079
Author(s):  
Muhammad Firoz Mridha ◽  
Abu Quwsar Ohi ◽  
Muhammad Mostafa Monowar ◽  
Md. Abdul Hamid ◽  
Md. Rashedul Islam ◽  
...  
Keyword(s):  
Speaker Recognition ◽  
Large Scale ◽  
English Language ◽  
Domain Adaptation ◽  
Recognition System ◽  
Extraction Process ◽  
Unlabeled Data ◽  
Training Strategy ◽  
Speech Segment ◽  
Recognition Systems

Speaker recognition deals with recognizing speakers by their speech. Most speaker recognition systems are built upon two stages, the first stage extracts low dimensional correlation embeddings from speech, and the second performs the classification task. The robustness of a speaker recognition system mainly depends on the extraction process of speech embeddings, which are primarily pre-trained on a large-scale dataset. As the embedding systems are pre-trained, the performance of speaker recognition models greatly depends on domain adaptation policy, which may reduce if trained using inadequate data. This paper introduces a speaker recognition strategy dealing with unlabeled data, which generates clusterable embedding vectors from small fixed-size speech frames. The unsupervised training strategy involves an assumption that a small speech segment should include a single speaker. Depending on such a belief, a pairwise constraint is constructed with noise augmentation policies, used to train AutoEmbedder architecture that generates speaker embeddings. Without relying on domain adaption policy, the process unsupervisely produces clusterable speaker embeddings, termed unsupervised vectors (u-vectors). The evaluation is concluded in two popular speaker recognition datasets for English language, TIMIT, and LibriSpeech. Also, a Bengali dataset is included to illustrate the diversity of the domain shifts for speaker recognition systems. Finally, we conclude that the proposed approach achieves satisfactory performance using pairwise architectures.

scholarly journals A Multiscale Chaotic Feature Extraction Method for Speaker Recognition

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Jiang Lin ◽  
Yi Yumei ◽  
Zhang Maosheng ◽  
Chen Defeng ◽  
Wang Chao ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Speaker Recognition ◽  
Extraction Method ◽  
State Of The Art ◽  
Recognition System ◽  
Nonlinear Dynamic Model ◽  
Feature Extraction Method ◽  
Analysis Technique ◽  
Recognition Systems ◽  
Environment Noise

In speaker recognition systems, feature extraction is a challenging task under environment noise conditions. To improve the robustness of the feature, we proposed a multiscale chaotic feature for speaker recognition. We use a multiresolution analysis technique to capture more finer information on different speakers in the frequency domain. Then, we extracted the speech chaotic characteristics based on the nonlinear dynamic model, which helps to improve the discrimination of features. Finally, we use a GMM-UBM model to develop a speaker recognition system. Our experimental results verified its good performance. Under clean speech and noise speech conditions, the ERR value of our method is reduced by 13.94% and 26.5% compared with the state-of-the-art method, respectively.

A Structured Approach towards Robust Database Collection for Speaker Recognition

2017 ◽  
Vol 9 (3) ◽  
pp. 53 ◽  
Author(s):  
Pardeep Sangwan ◽  
Saurabh Bhardwaj
Keyword(s):  
Feature Extraction ◽  
Speaker Recognition ◽  
Recognition System ◽  
Classification Methods ◽  
Extraction Techniques ◽  
Recognition Phase ◽  
Speech Database ◽  
Biometric Systems ◽  
Recognition Systems ◽  
Structured Approach

<p>Speaker recognition systems are classified according to their database, feature extraction techniques and classification methods. It is analyzed that there is a much need to work upon all the dimensions of forensic speaker recognition systems from the very beginning phase of database collection to recognition phase. The present work provides a structured approach towards developing a robust speech database collection for efficient speaker recognition system. The database required for both systems is entirely different. The databases for biometric systems are readily available while databases for forensic speaker recognition system are scarce. The paper also presents several databases available for speaker recognition systems.</p><p> </p>

Sign in / Sign up

Export Citation Format

Share Document