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.
Our contribution in this paper is two fold. First, we propose a novel discretization of the forward model for differential phase-contrast imaging that uses B-spline basis functions. The approach yields a fast and accurate algorithm for implementing the for ...
Our contribution in this paper is two fold. First, we propose a novel discretization of the forward model for differential phase-contrast imaging that uses B-spline basis functions. The approach yields a fast and accurate algorithm for implementing the fo ...
The goal of this paper is to propose diffusion LMS techniques for distributed estimation over adaptive networks, which are able to exploit sparsity in the underlying system model. The approach relies on convex regularization, common in compressive sensing, ...
We develop a principled way of identifying probability distributions whose independent and identically distributed realizations are compressible, i.e., can be well approximated as sparse. We focus on Gaussian compressed sensing, an example of underdetermin ...
We address the mining of sequential activity patterns from document logs given as word-time occurrences. We achieve this using topics that models both the cooccurrence and the temporal order in which words occur within a temporal window. Discovering such t ...
Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or super-resolution, can be addressed by maximizing the posterior distribution of a sparse linear model (SLM). We show how higher- ...
In this paper we present an efficient numerical scheme for the recently introduced Geodesic Active Fields (GAF) framework for geometric image registration. This framework considers the registration task as a weighted minimal surface problem. Hence, data-te ...
This paper proposes a joint reconstruction algorithm for compressed correlated images that are given under the form of linear measurements. We first propose a geometry based model in order to describe the correlation between visual information in pairs of ...
Popular transforms, like the discrete cosine transform or the wavelet transform, owe their success to the fact that they promote sparsity. These transforms are capable of extracting the structure of a large class of signals and representing them by a few t ...
We address the mining of sequential activity patterns from document logs given as word-time occurrences. We achieve this using topics that models both the cooccurrence and the temporal order in which words occur within a temporal window. Discovering such t ...