Publication

Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks

Related publications (90)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Geometry-aware analysis of high-dimensional visual information sets

Effrosyni Kokiopoulou

Over the past few decades we have been experiencing a data explosion; massive amounts of data are increasingly collected and multimedia databases, such as YouTube and Flickr, are rapidly expanding. At the same time rapid technological advancements in mobil ...

EPFL2009

THE ACCEPTANCE OF A MULTIMODAL ROUTING SYSTEM

Multimodal Routing Systems allow routing by different modes which is particularly interesting in urban environments. These systems are expected to be an important tool to encourage modal shift. They can only work, however, if people accept and use this tec ...

2009

Appearance-based Keypoint Clustering

Pascal Fua, Sabine Süsstrunk, Vincent Lepetit, Francisco Estrada

We present an algorithm for clustering sets of detected interest points into groups that correspond to visually distinct structure. Through the use of a suitable colour and texture representation, our clustering method is able to identify keypoints that be ...

2009

Flickr Hypergroups

Daniel Gatica-Perez, Radu Andrei Negoescu

The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often self-organize in user communities through Flickr Groups. These groups are part ...

2009

Flickr Hypergroups

Daniel Gatica-Perez, Radu Andrei Negoescu

Idiap2009

Likelihood estimation of the extremal index

Mária Süveges

The extension of the likelihood method of Süveges (Extremes, 2007) is presented. The extension allows for finding independent clusters of extreme events and determining the range of dependence on extremal levels, and estimate clustering characteristic of t ...

2007

Counting pedestrians in video sequences using trajectory clustering

Jean-Philippe Thiran, Gianluca Antonini

In this paper we propose to use clustering methods for automatic counting of pedestrians in video sequences. As input, we consider the output of those detection/ tracking systems that overestimate the number of targets. Clustering techniques are applied to ...

2006

Kernelized Infomax Clustering

We propose a simple information-theoretic clustering approach based on maximizing the mutual information

I(\sfx,y)

between the unknown cluster labels

y

and the training patterns

\sfx

with respect to parameters of specifically constrained encoding dis ...

IDIAP2005

Multi-layer hierarchical clustering of pedestrian trajectories for automatic counting of people in video sequences

Jean-Philippe Thiran, Gianluca Antonini

In this paper we propose an approach to count the number of pedestrians, given a trajectory data set provided by a tracking system. The tracking process itself is treated as a black box providing us the input data. The idea is to apply a hierarchical clust ...

IEEE2005

Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams

Giovanni De Micheli, Luca Benini

The biclustering method can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse in gene expression measurement. This is because the biclustering approach, in contrast to the conventional clustering ...

2005

Kernelized Infomax Clustering

We propose a simple information-theoretic clustering approach based on maximizing the mutual information

I(\sfx,y)

between the unknown cluster labels

y

and the training patterns

\sfx

with respect to parameters of specifically constrained encoding dis ...

IDIAP2005