Concept

Polynôme de Laguerre

Publications associées (84)

Three dimensional shape measurement using high-order instantaneous moments based fringe projection method

Fringe projection techniques are popular tools for three-dimensional shape measurement in optical metrology. In these techniques, the information about the shape or the surface profile of an object is usually encoded in the phase of a recorded fringe patte ...

2011

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011

Linearization techniques for band structure calculations in absorbing photonic crystals

Daniel Kressner, Peter Cedric Effenberger

Band structure calculations for photonic crystals require the numerical solution of eigenvalue problems. In this paper, we consider crystals composed of lossy materials with frequency-dependent permittivities. Often, these frequency dependencies are modele ...

2011

MATHICSE Technical Report : Analysis of the discrete $L^2$ projection on polynomial spaces with random evaluations

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

MATHICSE2011

Estimation of Phase in Fringe Projection Technique Using High-order Instantaneous Moments Based Method

Pramod Rastogi, Sai Siva Gorthi

For three-dimensional (3D) shape measurement using fringe projection techniques, the information about the 3D shape of an object is encoded in the phase of a recorded fringe pattern. The paper proposes a high-order instantaneous moments based method to est ...

AIP Conf. Proc.2010

Sur la méthode de Buser-Silhol pour l'uniformisation des surfaces de Riemann hyperelliptiques

Grégoire Aubry

The Uniformization Theorem due to Koebe and Poincaré implies that every compact Riemann surface of genus greater or equal to 2 can be endowed with a metric of constant curvature – 1. On the other hand, a compact Riemann surface is a complex algebraic curve ...

EPFL2010

Stationary and time-dependent correlations in polariton condensates

Paolo Schwendimann, Antonio Quattropani, Davide Sarchi

The statistics of the condensed polaritons is described in terms of the Wigner function. In the framework of the truncated Wigner method, the Wigner function obeys a Fokker-Planck equation, which is solved analytically. The second-order correlations in the ...

2010

Spectral element approximation of the incompressible Navier-Stokes equations in a moving domain and applications

Gonçalo Pena

In this thesis we address the numerical approximation of the incompressible Navier-Stokes equations evolving in a moving domain with the spectral element method and high order time integrators. First, we present the spectral element method and the basic to ...

EPFL2009

Coding along Hermite polynomials for interference channels

Emmanuel Abbé

This paper analyzes the use of non-Gaussian input distributions over the Gaussian interference channel. It has been recently proved that the iid Gaussian code ensemble together with a decoder that treats interference as noise is sum-capacity achieving, if ...

2009

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

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