Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Generalized cosine similarity in I-vector based automatic speaker recognition systems

Authors

[ 1 ] Katedra Sterowania i Inżynierii Systemów, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Year of publication

2013

Chapter type

paper

Publication language

english

Abstract

EN This paper deals with the problem of processing of I-vectors in the text-independent speaker verification systems. A new generalized cosine similarity optimization technique is proposed. The optimization is performed over sets of orthogonal and diagonal matrices. Lie group techniques are used in order to obtain exact orthogonal matrix solution. The experiments have been performed using the NIST 2010 database. It was shown that a substantial equal error rate (EER) reduction can be obtained with the proposed algorithm.

Pages (from - to)

73 - 77

URL

https://ieeexplore.ieee.org/document/6710600

Book

SPA 2013 Signal Processing: Algorithms, Architectures, Arrangements, and Applications, Poznań, 26-28 September, 2013 : Conference Proceedings

Presented on

SPA 2013 Signal Processing - Algorithms, Architectures, Arrangements, and Applications, 26-28.09.2013, Poznan, Poland

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.