Concept

Champ aléatoire de Markov

Publications associées (119)

Conditional Random Fields for Multi-Camera Object Detection

Pascal Fua, Horesh Beny Ben Shitrit, Xavier Boix Bosch, Gemma Roig Noguera

We formulate a model for multi-class object detection in a multi-camera environment. From our knowledge, this is the first time that this problem is addressed taken into account different object classes simultaneously. Given several images of the scene tak ...

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

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

On the Convergence of EM-Like Algorithms for Image Segmentation using Markov Random Fields

Meritxell Bach Cuadra, Delphine Ribes Lemay, Gunnar Krüger, Alexis Roche

Inference of Markov random field images segmentation models is usually performed using iterative methods which adapt the well-known expectation-maximization (EM) algorithm for independent mixture models. However, some of these adaptations are ad-hoc and ma ...

2011

Finite Block-Length Achievable Rates for Queuing Timing Channels

Thomas Riedl

The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attemp ...

2011

Fusion of Multi-Atlas Segmentations with Spatial Distribution Modeling

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

In recent years, multi-atlas fusion methods have gained significant attention in medical image segmentation. In this paper, we propose a general Markov Random Field (MRF) based framework that can perform edge-preserving smoothing of the labels at the time ...

2011

GeneNetWeaver: In silico benchmark generation and performance profiling of network inference methods

Dario Floreano, Daniel Marbach, Thomas Schaffter

Motivation: Over the last decade, numerous methods have been developed for inference of regulatory networks from gene expression data. However, accurate and systematic evaluation of these methods is hampered by the difficulty of constructing adequate bench ...

Oxford University Press2011

Neural conditional random fields

We propose a non-linear graphical model for structured prediction. It combines the power of deep neural networks to extract high level features with the graphical framework of Markov networks, yielding a powerful and scalable probabilistic model that we ap ...

JMLR: W&CP2010

Criteria for hitting probabilities with applications to systems of stochastic wave equations

Robert Dalang

We develop several results on hitting probabilities of random fields which highlight the role of the dimension of the parameter space. This yields upper and lower bounds in terms of Hausdorff measure and Bessel-Riesz capacity, respectively. We apply these ...

2010

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