Publication

Halton Sampling for Image Registration Based on Mutual Information

Publications associées (46)

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

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

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 ...

2013

Role of sampling in evaluating classical time autocorrelation functions

Jiri Vanicek, Tomas Zimmermann

We analyze how the choice of the sampling weight affects efficiency of the Monte Carlo evaluation of classical time autocorrelation functions. Assuming uncorrelated sampling or sampling with constant correlation length, we propose a sampling weight for whi ...

American Institute of Physics2013

Learning Ridge Functions With Randomized Sampling In High Dimensions

Volkan Cevher, Hemant Tyagi

We study the problem of learning ridge functions of the form f(x) = g(aT x), x ∈ ℝd, from random samples. Assuming g to be a twice continuously differentiable function, we leverage techniques from low rank matrix recovery literature to derive a uniform app ...

IEEE2012

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Network Design via Core Detouring for Problems Without a Core

Thomas Rothvoss

Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recent work [Eisenbrand,Grandoni,Rothvo\ ...

Springer2010

Distributed Sampling of Signals Linked by Sparse Filtering: Theory and Applications

Martin Vetterli, Olivier Roy, Yue Lu, Ali Hormati

We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin to a Slepian-Wolf setup, but in the sampling rather than the lossless compres ...

2010

Non-linear interpolation and adaptive sampling of scattering parameters

Michael Mattes

The accurate and efficient sampling of scattering parameters is addressed. A popular sampling technique is the uniform sampling combined with a straight-line interpolation for representing the continuous variation of the observable. However, this sampling ...

2010

Combining the Frontal and Side AAM For Robust Face Detection

Anil Yuce

The statistical modelling of faces using Active Appearance Models is an efficient approach to detect and interpret faces. Two important drawbacks of the method are the lack of robustness against occlusions and side poses of the face. The FR-PCA algorithm i ...

2010

A Closed-Form Solution for the Uniform Sampling of the Epipolar Line via Non-Uniform Depth Sampling

Engin Tola

Given two camera calibrations, this report presents a closed form algorithm that computes a sequence of 3D points such that they all project to a single location on one camera and that their projection forms a uniformly sampled line on the other camera. ...

2010