Publications associées à SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Results on Sparse Integer Programming and Geometric Independent Sets

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Toward responsible face datasets: modeling the distribution of a disentangled latent space for sampling face images from demographic groups

Sébastien Marcel, Christophe René Joseph Ecabert, Parsa Rahimi Noshanagh

Recently, it has been exposed that some modern facial recognition systems could discriminate specific demographic groups and may lead to unfair attention with respect to various facial attributes such as gender and origin. The main reason are the biases in ...

IEEE2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Unsupervised Visual Entity Abstraction towards 2D and 3D Compositional Models

Beril Besbinar

Object-centric learning has gained significant attention over the last years as it can serve as a powerful tool to analyze complex scenes as a composition of simpler entities. Well-established tasks in computer vision, such as object detection or instance ...

EPFL2022

Computational tool for stock-constrained design of structures

Corentin Jean Dominique Fivet, Jan Friedrich Georg Brütting, Jonas Warmuth

Designing structures from reused elements is becoming an increasingly important design task for structural engineers as it has potential to significantly reduce adverse environmental impacts of building structures. To allow for a broad application of this ...

2021

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Fabio Nobile, Davide Pradovera

We present a technique for Model Order Reduction (MOR) of frequency-domain problems relying on rational interpolation of vector-valued functions. The selection of the sample points is carried out adaptively according to a greedy procedure. We describe seve ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

Over-the-Air Computation via Reconfigurable Intelligent Surface

Wei Chen, Yuning Jiang

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...

2021

Minimum energy adaptive structures – All-In-One problem formulation

Gennaro Senatore, Yafeng Wang

This paper presents a new All-In-One (AIO) implementation of an existing formulation to design adaptive structures through Total Energy Optimization (TEO). The method implemented in previous work is a nested optimization process, here named TEO-Nested. Num ...

2020

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Fabio Nobile, Davide Pradovera

We present a technique for Model Order Reduction (MOR) of frequency-domain problems relying on rational interpolation of vector-valued functions. The selection of the sample points is carried out adaptively according to a greedy procedure. We describe seve ...

MATHICSE2020

Generating Master Faces for Use in PerformingWolf Attacks on Face Recognition Systems

Sébastien Marcel

Due to its convenience, biometric authentication, especial face authentication, has become increasingly mainstream and thus is now a prime target for attackers. Presentation attacks and face morphing are typical types of attack. Previous research has shown ...

IEEE2020

Learn to synthesize and synthesize to learn

Jean-Philippe Thiran, Mohammad Saeed Rad, Hazim Kemal Ekenel, Seyedbehzad Bozorgtabar

Attribute guided face image synthesis aims to manipulate attributes on a face image. Most existing methods for image-to-image translation can either perform a fixed translation between any two image domains using a single attribute or require training data ...

2019

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019

A Geometry-Inspired Decision-Based Attack

Pascal Frossard, Seyed Mohsen Moosavi Dezfooli, Yujia Liu

Deep neural networks have recently achieved tremendous success in image classification. Recent studies have however shown that they are easily misled into incorrect classification decisions by adversarial examples. Adversaries can even craft attacks by que ...

IEEE COMPUTER SOC2019

When Stuck, Flip a Coin : New Algorithms for Large-Scale Tasks

Slobodan Mitrovic

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

EPFL2018

Priority coordination of fiber positioners in multi-objects spectrographs

Denis Gillet, Mohamed Bouri, Laleh Makarem, Jean-Paul Richard Kneib

Projects such as "The Dark Energy Spectroscopic Instrument" (DESI) [1] or "The Multi Object Optical and Near-infrared Spectrograph" (MOONS) [5] are developing spectrographs, composed of more than thousand of optical fibers in a confined hexagonal focal pla ...

SPIE-INT SOC OPTICAL ENGINEERING2018

Real-time implementation with FPGA-based DAQ system of a probabilistic disruption predictor from scratch

Patrick Blanchard, Basil Duval, Ambrogio Fasoli, Yves Martin, Richard Pitts, Olivier Sauter, Henri Weisen, Robin Humphry-Baker, Stefano Coda, Martinus Gijs, Partha Dutta, Marco Wischmeier, Jan Horacek, Vlad Trifa, Yann Camenen, Jonathan Graves, Duccio Testa, Miguel Fernández Ruiz, Sun Hee Kim, Mikhail Maslov, Javier García Hernández, David Pfefferlé, José Pedro Rebelo Ferreira Marques, Julio Rodriguez, Pedro Camilo de Oliveira e Silva, Rebecca Hill, Daniel Scott Alessi, Jonnathan Cesar Hidalgo Acosta, Ana Francisca Leal Silva Soares, Dalziel Joseph Wilson, Pierre-Thomas Paul Brun, Jonathan Marc Philippe Faustin, Federico Nespoli, Alberto Hernando de Castro, Hamish William Patten, Bruno Emanuel Ferreira De Sousa Correia, Li Shuai, Nicola Vianello, Antonio José Pereira de Figueiredo, , , , , , , , ,

Variational Methods for Human Modeling

Timur Bagautdinov

A large part of computer vision research is devoted to building models and algorithms aimed at understanding human appearance and behaviour from images and videos. Ultimately, we want to build automated systems that are at least as capable as people when i ...

EPFL2018

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

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

Florian Lucas Jaton

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, Ilija Bogunovic, Slobodan Mitrovic, Jonathan Mark Scarlett

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