Publication

Robust and Efficient Data Clustering with Signal Processing on Graphs

Related publications (217)

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.

Discovering Human Places of Interest from Multimodal Mobile Phone Data

Daniel Gatica-Perez

In this paper, a new framework to discover places-of-interest from multimodal mobile phone data is presented. Mobile phones have been used as sensors to obtain location information from usersâ€™ real lives. Two levels of clustering are used to obtain place ...

2010

Robust Duplicate Detection of 2D and 3D Objects

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we analyze our graph-based approach for 2D and 3D object duplicate detection in still images. A graph model is used to represent the 3D spatial information of the object based on the features extracted from training images so that an explici ...

2010

A Magnetic Procedure for the Stability Number

Dominique de Werra

A magnet is a pair u, v of adjacent vertices such that the proper neighbours of u are completely linked to the proper neighbours of v. It has been shown that one can reduce the graph by removing the two vertices u, v of a magnet and introducing a new verte ...

2009

Model-free data interpretation for continuous monitoring of complex structures

Daniele Posenato

Structural Health Monitoring (SMH) has the potential to provide reliable, quantitative data on the real condition of structures. Early detection of damage or deterioration can enable preventive repair and reduce maintenance costs. Although obtaining data f ...

EPFL2009

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

Using Three States for Binary Consensus on Complete Graphs

Etienne Perron, Dinkar Vasudevan, Milan Vojnovic

We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts ...

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

Inhibition of tyrosine kinase receptors by SU6668 promotes abnormal stromal development at the periphery of carcinomas

Alessandro Daducci

Dynamic contrast-enhanced (albumin-Gd-DTPA) magnetic resonance imaging, performed during 2 weeks of daily administration of an inhibitor of tyrosine kinase receptors (SU6668) in an HT-29 colon carcinoma model, revealed the onset of a hyper-enhancing rim, n ...

Nature Publishing Group2009

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

A Fast and Exact Algorithm for the Median-of-Three Problem: A Graph Decomposition Approach

Wei Xu

In a previous article, we have shown that adequate subgraphs can be used to decompose multiple breakpoint graphs, achieving a dramatic speedup in solving the median problem. In this article, focusing on the median of three problem, we prove more important ...

Mary Ann Liebert2009