Publication

A multi target bearing tracking system using random sampling consensus

Publications associées (49)

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

Kinematics of age mixing in advection-dispersion models

Andrea Rinaldo, Paolo Benettin, Gianluca Botter

This paper investigates age mixing processes arising in advection-dispersion models, where large-scale travel and residence time distributions can be explicitly calculated based on the underlying velocity field. In particular, we analyze spatially integrat ...

American Geophysical Union2013

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

Sample and Pixel Weighting Strategies for Robust Incremental Visual Tracking

Michel Bierlaire, Jean-Philippe Thiran, Javier Cruz Mota

In this paper, we introduce the incremental temporally weighted principal component analysis (ITWPCA) algorithm, based on singular value decomposition update, and the incremental temporally weighted visual tracking with spatial penalty (ITWVTSP) algorithm ...

Institute of Electrical and Electronics Engineers2013

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

Effective Enrichment of Gene Expression Data Sets

Utku Sirin

The ever-growing need for gene-expression data analysis motivates studies in sample generation due to the lack of enough gene-expression data. It is common that there are thousands of genes but only tens or rarely hundreds of samples available. In this pap ...

2012

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Sample and Pixel Weighting Strategies for Robust Incremental Visual Tracking

Michel Bierlaire, Jean-Philippe Thiran, Javier Cruz Mota

In this paper we introduce the Incremental Temporally Weighted Principal Component Analysis (ITWPCA) algorithm, based on SVD update, and the Incremental Temporally Weighted Visual Tracking with Spatial Penalty (ITWVTSP) algorithm for robust visual tracking ...

2011

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

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