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.
We show that a multi-dimensional scaling function of order γ (possibly fractional) can always be represented as the convolution of a polyharmonic B-spline of order γ and a distribution with a bounded Fourier transform which has neither order nor smoothness ...
Recently, a nonlinear transformation of autocorrelation coefficients named Phase AutoCorrelation (PAC) coefficients has been considered for feature extraction \cite{ikbal03}. PAC based features show improved robustness to additive noise as a result of two ...
Recently, a nonlinear transformation of autocorrelation coefficients named Phase AutoCorrelation (PAC) coefficients has been considered for feature extraction \cite{ikbal03}. PAC based features show improved robustness to additive noise as a result of two ...
In 1983, Burt and Adelson introduced the Laplacian pyramid (LP) as a multiresolution representation for images. We study the LP using the frame theory, and this reveals that the usual reconstruction is suboptimal. We show that the LP with orthogonal filter ...
Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an ob ...
We describe a new family of scaling functions, the (α, τ)-fractional splines, which generate valid multiresolution analyses. These functions are characterized by two real parameters: α, which controls the width of the scaling functions; and τ, which specif ...
We consider the problem of low-complexity timing synchronization in digital receivers for DS-CDMA and UWB systems operating over channels with single or multiple propagation paths. We extend some of our recent sampling results for certain classes of non-ba ...
The perfectly synchronized round model provides the powerful abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We present an implementation of this abstraction in a distributed system ...
In order to numerically solve the interior and the exterior Dirichlet problems for the Laplacian operator, we have presented in a previous paper a method which consists in inverting, on a finite element space, a non-singular integral operator for circular ...
We present a theory of fast and perfect detector components that extends the theory of detectors and correctors of Arora and Kulkarni, and based on which, we develop an algorithm that automatically transforms a fault-intolerant program into a fail-safe fau ...
