This work aims at reducing the memory demand of the data structures that are usually pre–computed and stored for fast computation of the i-vectors, a compact representation of spoken utterances that is used by most state–of–the–art speaker recognition systems. We propose two new approaches allowing accurate i-vector extraction but requiring less memory, showing their relations with the standard computation method introduced for eigenvoices, and with the recently proposed fast eigen–decomposition technique. The first approach computes an i–vector in a Variational Bayes (VB) framework by iterating the estimation of one sub–block of i–vector elements at a time, keeping fixed all the others, and can obtain i–vectors as accurate as the ones obtained by the standard technique but requiring only 25% of its memory. The second technique is based on the Conjugate Gradient solution of a linear system, which is accurate and uses even less memory, but is slower than the VB approach. We analyze and compare the time and memory resources required by all these solutions, which are suited to different applications, and we show that it is possible to get accurate results greatly reducing memory demand compared with the standard solution at almost the same speed.
Memory and computation trade-offs for efficient i-vector extraction / Cumani, Sandro; Laface, Pietro. - In: IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING. - ISSN 1558-7916. - STAMPA. - 21:5(2013), pp. 934-944. [10.1109/TASL.2013.2239291]
|Titolo:||Memory and computation trade-offs for efficient i-vector extraction|
|Data di pubblicazione:||2013|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/TASL.2013.2239291|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Memory and computation trade-offs for efficient i-vector extraction.pdf||Articolo principale||2. Post-print / Author's Accepted Manuscript||PUBBLICO - Tutti i diritti riservati||Visibile a tuttiVisualizza/Apri|