![event thumbnail image](http://hydro.ijs.si/v00c/dd/3xlpfpnte5yvo2fkbumtbr7dune3ncon.jpg)
Constellations and the Unsupervised Learning of Graphs
author: Francisco Escolano,
Department of Science of the Computation and Artificial Intelligence, University of Alicante
published: July 12, 2007, recorded: June 2007, views: 3555
published: July 12, 2007, recorded: June 2007, views: 3555
Slides
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an EM central clustering algorithm which builds prototypical graphs on the basis of fast matching with graph transformations. Our experiments, both with random graphs and in realistic situations (visual localization), show that our prototypes improve the set median graphs and also the prototypes derived from our previous incremental method. We also discuss how the method scales with a growing number of images.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: