Publication

Distributed Spatio-Temporal Sampling of Diffusion Fields from Sparse Instantaneous Sources

Publications associées (38)

Spatial Super-Resolution of a Diffusion Field by Temporal Oversampling in Sensor Networks

We study the spatial-temporal sampling of a linear diffusion field, and show that it is possible to compensate for insufficient spatial sampling densities by oversampling in time. Our work is motivated by the following issue often encountered in sensor net ...

2009

On the capacity of multisource non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the r ...

2009

Sport Players Detection and Tracking With a Mixed Network of Planar and Omnidirectional Cameras

Pierre Vandergheynst, Alexandre Massoud Alahi, Laurent Jacques

A generic approach is presented to detect and track people with a network of fixed and omnidirectional cameras given severely degraded foreground silhouettes. The problem is formulated as a sparsity constrained inverse problem. A dictionary made of atoms r ...

2009

Network Resource Allocation for Competing Multiple Description Transmissions

Suhas Diggavi

Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...

2008

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007

Tomographic approach for parametric estimation of local diffusive sources and application to heat diffusion

Martin Vetterli, Luciano Sbaiz, Ivana Jovanovic

We consider localized instantaneous sources that reside in a 2D dif- fusive environment. Our goal is to reconstruct the induced field from the measurements obtained by distributed sensors. Although the field is non-bandlimited, we capitalize on the fact th ...

2007

On the Multiterminal Rate-Distortion Function for Acoustic Sensing

Martin Vetterli, Emre Telatar, Robert Konsbruck

We consider the rate-distortion problem for recording a Gaussian acoustic field with an array of sensors equipped with microphones. Our analysis is based on the field's spatiotemporal correlation structure, which is induced by the physics of sound propagat ...

2006

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005

On the Throughput of Ad Hoc Networks using Connectivity Graphs

Christina Fragouli

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

2005

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