Publications related to SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

We get the algorithms of our ground truths: Designing referential databases in digital image processing

This article documents the practical efforts of a group of scientists designing an imageprocessing algorithm for saliency detection. By following the actors of this computer science project, the article shows that the problems often considered to be the st ...

SAGE Publications2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Real-Time High-Resolution Multiple-Camera Depth Map Estimation Hardware and Its Applications

Abdulkadir Akin

Depth information is used in a variety of 3D based signal processing applications such as autonomous navigation of robots and driving systems, object detection and tracking, computer games, 3D television, and free view-point synthesis. These applications r ...

EPFL2015

Localizing Polygonal Objects in Man-Made Environments

Xiaolu Sun

Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this thesis is the detection of polygonal objects, which are prevalent in man-made environments. Shape analysis ...

EPFL2015

Sparse Group Covers and Greedy Tree Approximations

Volkan Cevher, Luca Baldassarre

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Distributed Policy Evaluation Under Multiple Behavior Strategies

Ali H. Sayed

We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...

IEEE2015

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Jean-Marc Odobez

In many visual multi-object tracking applications, the question when to add or remove a target is not trivial due to, for example, erroneous outputs of object detectors or observation models that cannot describe the full variability of the objects to track ...

2011

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Jean-Marc Odobez

In many visual multi-object tracking applications, the question when to add or remove a target is not trivial due to, for example, erroneous outputs of object detectors or observation models that cannot describe the full variability of the objects to track ...

Idiap2011

Competition on Counter Measures to 2-D Facial Spoofing Attacks

Sébastien Marcel, André Anjos, Murali Mohan Chakka, Zhiwei Zhang

Spoofing identities using photographs is one of the most common techniques to attack 2-D face recognition systems. There seems to exist no comparative studies of different techniques using the same protocols and data. The motivation behind this competition ...

2011

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Graph Chatbot

Chat with Graph Search

We get the algorithms of our ground truths: Designing referential databases in digital image processing

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Real-Time High-Resolution Multiple-Camera Depth Map Estimation Hardware and Its Applications

Localizing Polygonal Objects in Man-Made Environments

Sparse Group Covers and Greedy Tree Approximations

Distributed Policy Evaluation Under Multiple Behavior Strategies

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Competition on Counter Measures to 2-D Facial Spoofing Attacks

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

We get the algorithms of our ground truths: Designing referential databases in digital image processing

Real-Time High-Resolution Multiple-Camera Depth Map Estimation Hardware and Its Applications

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Distributed Policy Evaluation Under Multiple Behavior Strategies

Competition on Counter Measures to 2-D Facial Spoofing Attacks

Localizing Polygonal Objects in Man-Made Environments

Exploiting Long-Term Observations for Track Creation and Deletion in Online Multi-Face Tracking

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Sparse Group Covers and Greedy Tree Approximations