Concept

Principe d'entropie maximale

Publications associées (139)

Packing a trunk - Now with a twist!

In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk. The problem is of practical importance due to a European industry norm whic ...

2005

Generative Independent Component Analysis for EEG Classification

Silvia Chiappa

We present an application of Independent Component Analysis (ICA) to the discrimination of mental tasks for EEG-based Brain Computer Interface systems. ICA is most commonly used with EEG for artifact identification with little work on the use of ICA for di ...

2005

Multi-resolution Spectral Entropy Based Feature for Robust ASR

Hervé Bourlard, Hemant Misra, Shajith Ikbal

Recently, entropy measures at different stages of recognition have been used in automatic speech recognition (ASR) task. In a recent paper, we proposed that formant positions of a spectrum can be captured by multi-resolution spectral entropy feature. In th ...

IDIAP2004

Entropy Based Combination of Tandem Representations for Noise Robust ASR

Hervé Bourlard, Hynek Hermansky, Hemant Misra, Shajith Ikbal

In this paper, we present an entropy based method to combine tandem representations of the recently proposed Phase AutoCorrelation (PAC) based features and Mel-Frequency Cepstral Coefficients (MFCC) features. PAC based features, derived from a nonlinear tr ...

2004

Entropy Based Combination of Tandem Representations for Noise Robust ASR

Hervé Bourlard, Hynek Hermansky, Hemant Misra, Shajith Ikbal

IDIAP2004

Phase AutoCorrelation (PAC) features in Entropy based Multi-Stream for Robust Speech Recognition

Hervé Bourlard, Hynek Hermansky, Hemant Misra, Shajith Ikbal

Methods to improve noise robustness of speech recognition systems often result in degradation of recognition performance for clean speech. Recently proposed Phase AutoCorrelation (PAC) \cite{ikbal03,ikbal03a} based features, showing noticeable improvement ...

2004

Discrete maximum principle for Galerkin approximations of the Laplace operator on arbitrary meshes

Erik Burman

We derive a nonlinear stabilized Galerkin approximation of the Laplace operator for which we prove a discrete maximum principle on arbitrary meshes and for arbitrary space dimension without resorting to the well-known acute condition or generalizations the ...

2004

Effects of system and environment parameters on the performance of network-based mobile station position estimators

Cyril Botteron

This paper provides an asymptotic performance evaluation of network-based or multilateral positioning systems, where the times and/or angles of arrival of the signals traveling from a mobile station (MS) to a set of fixed stations (FSs) are used to estimat ...

Institute of Electrical and Electronics Engineers2004

Review on the progress of the LHD experiment

Wilfred Anthony Cooper, Terunobu Akiyama, Kenji Tanaka

Recent progress in the Large Helical Device (LHD) experiment during the last 2 yr is reviewed. The LHD has been extending its operational regime toward fusion-relevant conditions while taking advantage of the net-current-free heliotron concept employing a ...

2004

New Entropy Based Combination Rules in HMM/ANN Multi-stream ASR

Hervé Bourlard, Hemant Misra, Vivek Tyagi

Classifier performance is often enhanced through combining multiple streams of information. In the context of multi-stream HMM/ANN systems in ASR, a confidence measure widely used in classifier combination is the entropy of the posteriors distribution outp ...

2003

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