Publications related to Sparsity Driven People Localization with a Heterogeneous Network of Cameras

Related publications (34)

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...

EPFL2024

Sparse Autoencoders for Speech Modeling and Recognition

Selen Hande Kabil

Speech recognition-based applications upon the advancements in artificial intelligence play an essential role to transform most aspects of modern life. However, speech recognition in real-life conditions (e.g., in the presence of overlapping speech, varyin ...

EPFL2023

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

IEEE2023

A comprehensive review of digital twin-part 2: roles of uncertainty quantification and optimization, a battery digital twin, and perspectives

Olga Fink

As an emerging technology in the era of Industry 4.0, digital twin is gaining unprecedented attention because of its promise to further optimize process design, quality control, health monitoring, decision- and policy-making, and more, by comprehensively m ...

SPRINGER2023

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

EPFL2022

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Lenka Zdeborová, Florent Gérard Krzakala, Bruno Loureiro, Luca Pesce

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022

Sparsely Observed Functional Time Series: Theory and Applications

Tomas Rubin

Functional time series is a temporally ordered sequence of not necessarily independent random curves. While the statistical analysis of such data has been traditionally carried out under the assumption of completely observed functional data, it may well ha ...

EPFL2021

Divergence-Based Adaptive Extreme Video Completion

Fabrice Jean Guibert, Sabine Süsstrunk, Majed El Helou, Ruofan Zhou, Frank Schmutz

Extreme image or video completion, where, for instance, we only retain 1% of pixels in random locations, allows for very cheap sampling in terms of the required pre-processing. The consequence is, however, a reconstruction that is challenging for humans an ...

IEEE2020

Good Vibrations and Unknown Excitations

Dalia Salem Hassan Fahmy El Badawy

Inspired by the human ability to localize sounds, even with only one ear, as well as to recognize objects using active echolocation, we investigate the role of sound scattering and prior knowledge in regularizing ill-posed inverse problems in acoustics. In ...

EPFL2020

Sparse and Parametric Modeling with Applications to Acoustics and Audio

Helena Peic Tukuljac

Recent advances in signal processing, machine learning and deep learning with sparse intrinsic structure of data have paved the path for solving inverse problems in acoustics and audio. The main task of this thesis was to bridge the gap between the powerfu ...

EPFL2020

Dynamic Model Pruning with Feedback

Martin Jaggi, Sebastian Urban Stich, Tao Lin, Luis Felipe Barba Flores

Deep neural networks often have millions of parameters. This can hinder their deployment to low-end devices, not only due to high memory requirements but also because of increased latency at inference. We propose a novel model compression method that gener ...

2020

Removing imaging systematics from galaxy clustering measurements with Obiwan: application to the SDSS-IV extended Baryon Oscillation Spectroscopic Survey emission-line galaxy sample

Cheng Zhao, Anand Stéphane Raichoor

This work presents the application of a new tool, Obiwan, which uses image simulations to determine the selection function of a galaxy redshift survey and calculate three-dimensional (3D) clustering statistics. Obiwan relies on a forward model of the proce ...

OXFORD UNIV PRESS2020

A deep learning framework for matching of SAR and optical imagery

Devis Tuia, Lloyd Haydn Hughes

SAR and optical imagery provide highly complementary information about observed scenes. A combined use of these two modalities is thus desirable in many data fusion scenarios. However, any data fusion task requires measurements to be accurately aligned. Wh ...

2020

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

EPFL2020

Compressive Multiplexing of Ultrasound Signals

Jean-Philippe Thiran, Yves Wiaux, Marcel Arditi, Adrien Georges Jean Besson, Dimitris Perdios

High-quality 3D ultrasound (US) imaging requires dense matrix-array probes with thousands of elements and necessitates an unrealistic number of coaxial cables to connect such probes to back-end systems. To address this issue, many techniques have been deve ...

IEEE2018

Solving Continuous-Domain Problems Exactly with Multiresolution B-Splines

Michaël Unser, Julien René Fageot, Thomas Jean Debarre, Harshit Gupta

We propose a discretization method for continuous-domain linear inverse problems with multiple-order total-variation (TV) regularization. It is based on a recent result that proves that such inverse problems have sparse polynomial-spline solutions. Our met ...

IEEE2019

Phonetic Subspace Features for Improved Query by Example Spoken Term Detection

Hervé Bourlard, Afsaneh Asaei, Dhananjay Ram

This paper addresses the problem of detecting speech utterances from a large audio archive using a simple spoken query, hence referring to this problem as "Query by Example Spoken Term Detection" (QbE-STD). This still open pattern matching problem has been ...

2018

Joint Sparsity with Partially Known Support and Application to Ultrasound Imaging

Jean-Philippe Thiran, Yves Wiaux, Adrien Georges Jean Besson, Dimitris Perdios

We investigate the benefits of known partial support for the recovery of joint-sparse signals and demonstrate that it is advantageous in terms of recovery performance for both rank-blind and rank-aware algorithms. We suggest extensions of several joint-spa ...

IEEE Institute of Electrical and Electronics Engineers2019

Low-rank and sparse subspace modeling of speech for DNN based acoustic modeling

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

Towards the goal of improving acoustic modeling for automatic speech recognition (ASR), this work investigates the modeling of senone subspaces in deep neural network (DNN) posteriors using low-rank and sparse modeling approaches. While DNN posteriors are ...

ELSEVIER SCIENCE BV2019

Learning with Structured Sparsity: From Discrete to Convex and Back

Marwa El Halabi

In modern-data analysis applications, the abundance of data makes extracting meaningful information from it challenging, in terms of computation, storage, and interpretability. In this setting, exploiting sparsity in data has been essential to the developm ...

EPFL2018