Vasileios Vasilakakis

dblp:08/10648 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 91% Trustworthy machine learning · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › speaker recognition
i-vector
0.212013
Pairwise Discriminative Speaker Verification in the 𝕀-Vector Space · IEEE Trans. Speech Audio Process. 2013
Natural language and speech › Speech recognition and synthesis
speaker recognition
0.212013
Pairwise Discriminative Speaker Verification in the 𝕀-Vector Space · IEEE Trans. Speech Audio Process. 2013
Natural language and speech › Speech recognition and synthesis › speaker recognition
speaker verification
0.212013
Pairwise Discriminative Speaker Verification in the 𝕀-Vector Space · IEEE Trans. Speech Audio Process. 2013
Machine learning › Trustworthy machine learning
pairwise classification
0.012013
Pairwise Discriminative Speaker Verification in the 𝕀-Vector Space · IEEE Trans. Speech Audio Process. 2013

Methods — techniques the papers use, named apart from their topics

symmetric quadratic function · 0.2support vector machine · 0.2
YearPublicationVenuePosition
2013 Pairwise Discriminative Speaker Verification in the 𝕀-Vector Space
abstract
This work presents a new and efficient approach to discriminative speaker verification in the${\rm i}$–vector space. We illustrate the development of a linear discriminative classifier that is trained to discriminate between the hypothesis that a pair of feature vectors in a trial belong to the same speaker or to different speakers. This approach is alternative to the usual discriminative setup that discriminates between a speaker and all the other speakers. We use a discriminative classifier based on a Support Vector Machine (SVM) that is trained to estimate the parameters of a symmetric quadratic function approximating a log–likelihood ratio score without explicit modeling of the${\rm i}$–vector distributions as in the generative Probabilistic Linear Discriminant Analysis (PLDA) models. Training these models is feasible because it is not necessary to expand the${\rm i}$–vector pairs, which would be expensive or even impossible even for medium sized training sets. The results of experiments performed on the tel-tel extended core condition of the NIST 2010 Speaker Recognition Evaluation are competitive with the ones obtained by generative models, in terms of normalized Detection Cost Function and Equal Error Rate. Moreover, we show that it is possible to train a gender–independent discriminative model that achieves state–of–the–art accuracy, comparable to the one of a gender–dependent system, saving memory and execution time both in training and in testing.
Sandro Cumani, Niko Brümmer, Lukás Burget, Pietro Laface, Oldrich Plchot, Vasileios Vasilakakis
IEEE Trans. Speech Audio Process.6
2011 Comparison of Speaker Recognition Approaches for Real Applications
abstract
This paper describes the experimental setup and the results obtained using several state-of-the-art speaker recognition classifiers.The comparison of the different approaches aims at the development of real world applications, taking into account memory and computational constraints, and possible mismatches with respect to the training environment.The NIST SRE 2008 database has been considered our reference dataset, whereas nine commercially available databases of conversational speech in languages different form the ones used for developing the speaker recognition systems have been tested as representative of an application domain.Our results, evaluated on the two domains, show that the classifiers based on i-vectors obtain the best recognition and calibration accuracy.Gaussian PLDA and a recently introduced discriminative SVM together with an adaptive symmetric score normalization achieve the best performance using low memory and processing resources.
Sandro Cumani, Pier Domenico Batzu, Daniele Colibro, Claudio Vair, Pietro Laface, Vasileios Vasilakakis
INTERSPEECH6