Concept

Échantillonnage de Gibbs

Publications associées (133)

Metropolis-Hastings sampling of paths

We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and he ...

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all p ...

2011

Three-Dimensional Imaging of a Radially Propagating Plasma Blob Using Conditional Sampling Techniques

Ambrogio Fasoli, Ivo Furno, Benoît Labit, Christian Gabriel Theiler

We present 3-D imaging of plasma blobs, generated from ideal interchange turbulence in the TORPEX device, obtained by applying different conditional sampling techniques to electrostatic probe data. Time-evolving spatial profiles of electron density, temper ...

2011

Resolution-Invariant Separable Arma Modeling Of Images

Michaël Unser, Aurélien Bourquard, Hagay Kirshner

We suggest a continuous-domain stochastic modeling of images that is invariant to spatial resolution. Specifically, we are proposing an estimator that is calibrated with respect to the sampling step, and that can potentially handle aliased data. Motivated ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Resolution-Invariant Separable ARMA Modeling of Images

Michaël Unser, Aurélien Bourquard, Hagay Kirshner

IEEE2011

A Sampling Theory Approach for Continuous ARMA Identification

Michaël Unser, Hagay Kirshner, Simona Maggio

The problem of estimating continuous-domain autoregressive moving-average processes from sampled data is considered. The proposed approach incorporates the sampling process into the problem formulation while introducing exponential models for both the cont ...

IEEE2011

On Variable Density Compressive Sampling

Pierre Vandergheynst, Yves Wiaux, Gilles Puy

We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution provides an optimize ...

Institute of Electrical and Electronics Engineers2011

Fast Imaging of Blob Motion in TORPEX Plasmas

Ambrogio Fasoli, Ivo Furno, Davoud Iraji

To complement electrostatic probe measurements of plasma turbulence and study plasma structures with high spatial resolution, a nonperturbative direct imaging system has been developed on TORPEX. This system includes a fast framing Photron-APX-RS camera an ...

2011

Comparison of Energy Minimization Methods for 3-D Brain Tissue Classification

Jean-Philippe Thiran, Meritxell Bach Cuadra, Subrahmanyam Venkata Ravi Mohana Sai Gorthi

This paper presents 3-D brain tissue classification schemes using three recent promising energy minimization methods for Markov random fields: graph cuts, loopy belief propagation and tree-reweighted message passing. The classification is performed using t ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

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