Concept

Divergence de Kullback-Leibler

Publications associées (220)

Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

Consider communication over a binary-input memoryless output-symmetric channel with low-density parity-check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the aver ...

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

Cooperative spectrum sensing via sequential detection for cognitive radio networks

Ali H. Sayed

Efficient and reliable spectrum sensing plays a critical role in cognitive radio networks. This paper presents a cooperative sequential detection scheme tominimize the average sensing time that is required to reach a detection decision. In the scheme, each ...

IEEE2009

On the Submodularity of Linear Experimental Design

Matthias Seeger

Here, I review facts that are most probably known, namely that the information gain criterion used to drive experimental design in a linear-Gaussian model is submodular, so that a well-known approximation guarantee holds for the sequential greedy algorithm ...

2009

Mutual Information based Channel Selection for Speaker Diarization of Meetings Data

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In the meeting case scenario, audio is often recorded using Multiple Distance Microphones (MDM) in a non-intrusive manner. Typically a beamforming is performed in order to obtain a single enhanced signal out of the multiple channels. This paper investigate ...

2009

Audio-visual reliability estimates using stream entropy for speech recognition

Jean-Philippe Thiran, Mihai Gurban

We present a method for multimodal fusion based on the estimated reliability of each individual modality. Our method uses an information theoretic measure, the entropy derived from the state probability distribution for each stream, as an estimate of relia ...

2009

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

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

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

Acoustic Models for Posterior Features in Speech Recognition

Guillermo Aradilla

Ecole Polytechnique Fédérale de Lausanne2008

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