Abstract

We propose variable-text text-dependent speaker-recognition systems based on the one-pass dynamic programming (DP) algorithm. The key feature of the proposed algorithm is its ability to use multiple templates for each of the words which form the `password' text. The use of multiple templates allows the proposed system to capture the idiosyncratic intra-speaker variability of a word, resulting in significant improvement in the performance. Our algorithm also uses inter-word silence templates to handle continuous speech input. We use the proposed one-pass DP algorithm in three speaker-recognition systems, namely, closed-set speaker-identification (CSI), speaker-verification (SV) and open-set speaker-identification (OSI). These systems were evaluated on a 100 speaker and 200 speaker tasks using the TIDIGITS database and with various car noise conditions. The key result of this paper is that the use of multiple templates enhances the performance of all the three systems significantly -the use of multiple templates (in comparison to a single template) enhances the CSI performance from 94% to 100%, the SV EER from 1.6% to 0.09% and the OSI EER from 12.3% to 3.5% on a 100 speaker task. We also use the proposed one-pass DP for automatically extracting the multiple templates from continuous speech training data. The performance of the three systems using such automatically extracted multiple templates is as good as with manually extracted templates. Front-end noise suppression enables our systems to deliver robust performance in up to 0 dB car noise

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.