Publication

Joint Segmentation and Path Classification of Curvilinear Structures

Publications associées (37)

A Topological Treatment of Early-Deciding Set-Agreement

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

Alumni Profiles

Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...

2009

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008

A collaborative approach to image segmentation and behavior recognition from image sequences

Laura Ioana Gui

Visual behavior recognition is currently a highly active research area. This is due both to the scientific challenge posed by the complexity of the task, and to the growing interest in its applications, such as automated visual surveillance, human-computer ...

EPFL2008

Illuminant retrieval for fixed location cameras

Sabine Süsstrunk, Joanna Marguier

Fixed location cameras, such as panoramic cameras or surveillance cameras, are very common. In images taken with these cameras, there will be changes in lighting and dynamic image content, but there will also be constant objects in the background. We propo ...

2008

On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

A Web Survey for Facial Expressions Evaluation

Michel Bierlaire, Jean-Philippe Thiran, Matteo Sorci, Gianluca Antonini

In the recent years, researchers have investigated several methods of facial expression analysis. Their interest has been to apply their algorithms to sets of images labelled by a restrained number of experts. In order to deal with the generalizability of ...

2008

Fast Adaptive Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

We demonstrate that it is possible to filter an image with an elliptic window of varying size, elongation and orientation with a fixed computational cost per pixel. Our method involves the application of a suitable global pre-integrator followed by a point ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Fast Adaptive Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

IEEE2008

Fast Adaptive Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

We demonstrate that it is possible to filter all image with an elliptic window of varying size, elongation and orientation with a fixed computational cost per pixel. Our method involves the application of a suitable global pre-integrator followed by a poin ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

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