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.
This paper proposes a joint reconstruction algorithm for compressed correlated images that are given under the form of linear measurements. We consider the particular problem where one image is selected as the reference image and it is used as the side inf ...
This study derives geometric, variational discretization of continuum theories arising in fluid dynamics, magnetohydrodynamics (MHD), and the dynamics of complex fluids. A central role in these discretizations is played by the geometric formulation of flui ...
Size effect in ferroelectrics is treated as a competition between the geometrical symmetry of the ferroelectric sample and its crystalline symmetry. Polarization rotation is shown to be a clear finite size effect that results from this competition, which c ...
The search for robust features for face recognition in uncontrolled environments is an important topic of research. In particular, there is a high interest in Gabor-based features which have invariance properties to simple geometrical transformations. In t ...
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) is an element of (0, 1] such that no matter how we map the vertices of H into R-d, there is a point covered by at least a c(H)-fraction of the simplices induced by the ...
We address the problem of building a manifold in order to represent a set of geometrically transformed images by selecting a good common sparse approximation of them with parametric atoms. We propose a greedy method to construct a representative pattern su ...
Motivated by the problem of longitudinal data assimilation, e.g., in the registration of a sequence of images, we develop the higher-order framework for Lagrangian and Hamiltonian reduction by symmetry in geometric mechanics. In particular, we obtain the r ...
In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM based algorithm to compute dense depth and occlusion maps from wide baseline image pairs using this descriptor. This yields much ...
Institute of Electrical and Electronics Engineers2010
Iterative models are widely used today in CAD. They allow, with a limited number of parameters, to represent relatively complex forms through a subdivision algorithm. There is a wide variety of such models (Catmull-Clark, Doo-Sabin, L-Systems...). Most ite ...