Publication

Differential Entropy of the Conditional Expectation Under Additive Gaussian Noise

Publications associées (37)

A New Entropy Power Inequality for Integer-Valued Random Variables

Emmanuel Abbé, Saeid Haghighatshoar

The entropy power inequality (EPI) yields lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for spe ...
Institute of Electrical and Electronics Engineers2014

Liouville's theorem and Laurent Series Expansions for Solutions of the Heat Equation

Aparajita Dasgupta

We give a Liouville theorem for entire solutions and Laurent series expansions for solutions with isolated singularities of the heat equation. ...
Springer Basel Ag2014

A Projected Gradient Algorithm for Image Restoration Under Hessian Matrix-Norm Regularization

Michaël Unser, Stamatios Lefkimmiatis

We have recently introduced a class of non-quadratic Hessian-based regularizers as a higher-order extension of the total variation (TV) functional. These regularizers retain some of the most favorable properties of TV while they can effectively deal with t ...
IEEE2012

Visual processing-inspired Fern-Audio features for Noise-Robust Speaker Verification

Sébastien Marcel, Anindya Roy

In this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, where the object instances are 1-D short-time spectral vectors obtained from the speech signal. More precisely, we investigate the ge ...
2010

BOOSTED BINARY FEATURES FOR NOISE-ROBUST SPEAKER VERIFICATION

Sébastien Marcel, Anindya Roy

The standard approach to speaker verification is to extract cepstral features from the speech spectrum and model them by generative or discriminative techniques. We propose a novel approach where a set of client-specific binary features carrying maximal di ...
2010

Distributed bearing estimation via matrix completion

Volkan Cevher

We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance distortionless response (MVDR), multiple signal classification, and maximum likeli ...
2010

Visual processing-inspired Fern-Audio features for Noise-Robust Speaker Verification

Sébastien Marcel, Anindya Roy

In this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, but the object instances are 1-D short-time spectral vectors obtained from the speech signal. More precisely, we investigate the gene ...
Idiap2009

Coding Along Hermite Polynomials for Gaussian Noise Channels

This paper shows that the capacity achieving input distribution for a fading Gaussian broadcast channel is not Gaussian in general. The construction of non-Gaussian distributions that strictly outperform Gaussian ones, for certain characterized fading dist ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Bounds on the Sum Capacity of Synchronous Binary CDMA Channels

Pedram Pad, Vahid Aref

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this ...
Institute of Electrical and Electronics Engineers2009

A Local Nonlinear Model for the Approximation and Identification of a Class of Systems

Based on Volterra series the work presents a novel local nonlinear model of a certain class of linear-analytic systems. The special form of the expressions for the Laplace-domain Volterra kernels of such systems is exploited to obtain an approximation stru ...
Institute of Electrical and Electronics Engineers2009

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.