Publication

Lower-bounds on the Bayesian Risk in Estimation Procedures via f–Divergences

Publications associées (38)

Lower and upper bounds for approximation of the Kullback-Leibler divergence between Gaussian Mixture Models

Jean-Philippe Thiran, Finnian Paul Kelly

Many speech technology systems rely on Gaussian Mixture Models (GMMs). The need for a comparison between two GMMs arises in applications such as speaker verification, model selection or parameter estimation. For this purpose, the Kullback-Leibler (KL) dive ...

Ieee2012

Sizing Studies for Detecting Graphical Models

Stephan Morgenthaler, Maya Shevlyakova

The ability to identify reliably a positive or negative partial correlation between the expression levels of two genes is determined by the number p of genes, the number n of analyzed samples, and the statistical properties of the measurements. Classical s ...

EPFL STAP2012

Diffusion networks outperform consensus networks

Ali H. Sayed

Adaptive networks consist of a collection of nodes that interact with each other on a local level and diffuse information across the network to solve estimation and inference tasks in a distributed manner. In this work, we compare the performance of two di ...

IEEE2012

An Information Theoretic Approach to Speaker Diarization of Meeting Recordings

Deepu Vijayasenan

In this thesis we investigate a non parametric approach to speaker diarization for meeting recordings based on an information theoretic framework. The problem is formulated using the Information Bottleneck (IB) principle. Unlike other approaches where the ...

EPFL2010

Anthropic Correction of Information Estimates and Its Application to Neural Coding

Michael Christoph Gastpar

Information theory has been used as an organizing principle in neuroscience for several decades. Estimates of the mutual information (MI) between signals acquired in neurophysiological experiments are believed to yield insights into the structure of the un ...

2010

An Information Theoretic Approach to Speaker Diarization of Meeting Data

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

A speaker diarization system based on an information theoretic framework is described. The problem is formulated according to the Information Bottleneck (IB) principle. Unlike other approaches where the distance between speaker segments is arbitrarily intr ...

2009

On MLP-based Posterior Features for Template-based ASR

Hervé Bourlard, Joel Praveen Pinto, Serena Soldo

We investigate the invariance of posterior features estimated using MLP trained on auxiliary corpus towards different data condition and different distance measures for matching posterior features in the context of template-based ASR. Through ASR studies o ...

Idiap2009

An Information Theoretic Approach to Speaker Diarization of Meeting Data

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

A speaker diarization system based on an information theoretic framework is described. The problem is formulated according to the {\em Information Bottleneck} (IB) principle. Unlike other approaches where the distance between speaker segments is arbitraril ...

IDIAP2008

Using Comparison of Parallel Phoneme Probability streams for OOV Word Detection

Mathew Magimai Doss, Hynek Hermansky, Tamara Tosic

In this paper, we investigate the approach of comparing two different parallel streams of phoneme posterior probability estimates for OOV word detection. The ﬁrst phoneme posterior probability stream is estimated using only the knowledge of short-term acou ...

2008

Acoustic models for posterior features in speech recognition

Guillermo Aradilla

In this thesis, we investigate the use of posterior probabilities of sub-word units directly as input features for automatic speech recognition (ASR). These posteriors, estimated from data-driven methods, display some favourable properties such as increase ...

EPFL2008

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search