Speaker Identification and its Multifaceted role in Forensic Science
Speaker identification stands as a pivotal technique, enabling investigators to pinpoint the originator of a given audio recording based on their voice patterns. This method has gained substantial traction across various legal contexts, from criminal investigations to intelligence operations. As our world becomes increasingly digitized, the ability to accurately identify a person by their voice…
by Zaw Win Aung" A Robust Speaker Identification System"
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018,
URL: http://www.ijtsrd.com/papers/ijtsrd18274.pdf
Direct URL: http://www.ijtsrd.com/other-scientific-research-area/other/18274/a-robust-speaker-identification-system/zaw-win-aung
ugc journal list, call for paper papers in journals, research papers
This paper is aimed to implement a robust speaker identification system. It is a software architecture which identifies the current talker out of a set of speakers. The system is emphasized on text-dependent speaker identification system. It contains three main modules: endpoint detection, feature extraction and feature matching. The additional module, endpoint detection, removes unwanted signal and background noise from the input speech signal before subsequent processing. In the proposed system, Short-Term Energy analysis is used for endpoint detection. Mel-frequency Cepstrum Coefficients (MFCC) is applied for feature extraction to extract a small amount of data from the voice signal that can later be used to represent each speaker. For feature matching, Vector Quantization (VQ) approach using Linde, Buzo and Gray (LBG) clustering algorithm is proposed because it can reduce the amount of data and complexity. The experimental study shows that the proposed system is more robust than using the original system and it is faster in computation than the existing one. To implement this system MATLAB is used for programming.