Concept

Diviser pour régner (informatique)

Publications associées (346)

Comparison between SOFI and STORM

Theo Lasser, Stefan Geissbühler, Claudio Dellagiacoma

A straightforward method to achieve super-resolution consists of taking an image sequence of stochastically blinking emitters using a standard wide-field fluorescence microscope. Densely packed single molecules can be distinguished sequentially in time usi ...

2011

Learning from Images with Captions Using the Maximum Margin Set Algorithm

Barbara Caputo, Jie Luo, Vittorio Ferrari

A large amount of images with accompanying text captions are available on the Internet. These are valuable for training visual classifiers without any explicit manual intervention. In this paper, we present a general framework to address this problem. Unde ...

Idiap2011

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Jorge Miguel Dias Almeida Rodrigues Soares

Opportunistic wireless sensor networks (WSNs) have recently been proposed as solutions for many remote monitoring problems. Many such problems, including environmental monitoring, involve large deployment scenarios with lower-than-average node density, as ...

2011

Random Sampling ADC for Sparse Spectrum Sensing

Andreas Peter Burg

Scanning large bandwidths (spectrum sensing) pushes today’s analog hardware to its limits since periodic sampling at Nyquist rate with sufficient resolution is often prohibitively complex. In this paper, we consider a scenario where the signal to be acquir ...

2011

Learning from Candidate Labeling Sets

Jie Luo

In many real world applications we do not have access to fully-labeled training data, but only to a list of possible labels. This is the case, e.g., when learning visual classifiers from images downloaded from the web, using just their text captions or tag ...

Idiap2011

Saliency-driven Black Point Compensation

Sabine Süsstrunk, Albrecht Johannes Lindner

We present a novel framework for automatically determining whether or not to apply black point compensation (BPC) in image reproduction. Visually salient objects have a larger influence on determining image quality than the number of dark pixels in an imag ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

Efficient Model Checking of Fault-Tolerant Distributed Protocols

Johannes Kinder

To aid the formal verification of fault-tolerant distributed protocols, we propose an approach that significantly reduces the costs of their model checking. These protocols often specify atomic, process-local events that consume a set of messages, change t ...

IEEE2011

Sparse Image Restoration Using Iterated Linear Expansion of Thresholds

Thierry Blu, Hanjie Pan

We focus on image restoration that consists in regularizing a quadratic data-fidelity term with the standard l1 sparse-enforcing norm. We propose a novel algorithmic approach to solve this optimization problem. Our idea amounts to approximating the result ...

2011

Distributed nonlinear Kalman filtering with applications to wireless localization

Ali H. Sayed

We study the problem of distributed state-space estimation, where a set of nodes are required to estimate the state of a nonlinear state-space system based on their observations. We extend our previous work on distributed Kalman filtering to the nonlinear ...

IEEE2010

Diffusion LMS Strategies for Distributed Estimation

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes is required to collectively estimate some parameter of interest from noisy measurements. The problem is useful in several contexts including wireless and sensor networks, where scalabi ...

IEEE2010

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