Publications related to A multi target bearing tracking system using random sampling consensus

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Random sampling of bandlimited signals on graphs

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure, and its performa ...

Elsevier2018

Safe Adaptive Importance Sampling

Martin Jaggi, Sebastian Urban Stich, Anant Raj

Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants - using importance values defined by the complete gradient information which changes during optimization - ...

2017

Quasi-random numbers for copula models

Mathieu Jacques David Cambou

The present work addresses the question how sampling algorithms for commonly applied copula models can be adapted to account for quasi-random numbers. Besides sampling methods such as the conditional distribution method (based on a one-to-one transformatio ...

Springer2017

Just Sort It! A Simple and Effective Approach to Active Preference Learning

Matthias Grossglauser, Lucas Maystre

We address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly. If all comparison outcomes are consistent with the ranking, the optimal sol ...

2017

Approximate Steepest Coordinate Descent

Martin Jaggi, Sebastian Urban Stich, Anant Raj

We propose a new selection rule for the coordinate selection in coordinate descent methods for huge-scale optimization. The efficiency of this novel scheme is provably better than the efficiency of uniformly random selection, and can reach the efficiency o ...

PMLR2017

Compressive Spectral Clustering

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a fea ...

2016

Random sampling of bandlimited signals on graphs

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We study the problem of sampling

k

-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, \ie, independent of the graph structure, and its perform ...

2015

Too much success for recent groundbreaking epigenetic experiments

Gregory Francis

An article reporting statistical evidence for epigenetic transfer of learned behavior has important implications, if true. With random sampling, real effects do not always result in rejection of the null hypothesis, but the reported experiments were unifor ...

Genetics Society of America2014

Random sampling of bandlimited signals on graphs

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We study the problem of sampling

k

2015

A multi target bearing tracking system using random sampling consensus

Graph Chatbot

Chat with Graph Search

Random sampling of bandlimited signals on graphs

Safe Adaptive Importance Sampling

Quasi-random numbers for copula models

Just Sort It! A Simple and Effective Approach to Active Preference Learning

Approximate Steepest Coordinate Descent

Compressive Spectral Clustering

Shapes from Pixels

Random sampling of bandlimited signals on graphs

Full-wavefield modeling and reverse time migration of laser ultrasound data: A feasibility study

Too much success for recent groundbreaking epigenetic experiments

Just Sort It! A Simple and Effective Approach to Active Preference Learning

Quasi-random numbers for copula models

Safe Adaptive Importance Sampling

Full-wavefield modeling and reverse time migration of laser ultrasound data: A feasibility study

Compressive Spectral Clustering

Random sampling of bandlimited signals on graphs

Random sampling of bandlimited signals on graphs

Approximate Steepest Coordinate Descent

Shapes from Pixels

Too much success for recent groundbreaking epigenetic experiments