A Track Creation and Deletion Framework for Long-Term Online Multi-Face Tracking
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.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree weighting. The main contribution is the addition of a prior, conditioned on conte ...
This article presents the implementation and initial test results for an algorithm called SuffStat MCMC, which aims to speed up Approximate Bayesian Computation without likelihood. ...
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a negative result on the rate of convergence of the generally used Markov chains. ...
Abstraction techniques based on simulation relations have become an important and effective proof technique to avoid the infamous state space explosion problem. In the context of Markov chains, strong and weak simulation relations have been proposed ((B. J ...
In this work, we propose new ways to learn pose and motion priors models and show that they can be used to increase the performance of 3D body tracking algorithms, resulting in very realistic motions under very challenging conditions. We first explored an ...
A Monte-Carlo method is used to calibrate a randomly placed sensor node using helicopter sounds. The calibration is based on using the GPS information from the helicopter and the estimated DOA's at the node. The related Cramer-Rao lower bound is derived an ...
The paper contains description of the implementation of C code for tree representation of Markov Chain Monte Carlo(MCMC) clustering. The aim of the code is to produce results which helps in visual representation of the most frequent pattern, its agglomerat ...
We apply the Metropolis-Hastings algorithm to efficiently sample from arbitrary paths distributions in a general network. Paths can be generalized into all-day travel plans through, e.g., an appropriate network expansion. The Metropolis-Hastings algorithm ...
We proposed a Bayesian model for the detection of asynchronous EEG patterns. Based on a skew normal model of the pattern of interest in the time-domain and on the assumption that background activity can be modeled as colored noise, we estimate both the pat ...
In this paper, we propose a Monte-Carlo method based on the particle filter framework to track footfall locations generated by mobile personnel using seismic arrays. While the particle proposal function follows a simple bootstrap approach, the novelty in o ...
